Energy-Constrained Programmable Matter Under Unfair Adversaries

Authors Jamison W. Weber , Tishya Chhabra , Andréa W. Richa , Joshua J. Daymude



PDF
Thumbnail PDF

File

LIPIcs.OPODIS.2023.7.pdf
  • Filesize: 5.21 MB
  • 21 pages

Document Identifiers

Author Details

Jamison W. Weber
  • School of Computing and Augmented Intelligence, Arizona State University, Tempe, AZ, USA
Tishya Chhabra
  • School of Computing and Augmented Intelligence, Arizona State University, Tempe, AZ, USA
Andréa W. Richa
  • School of Computing and Augmented Intelligence & Biodesign Center for Biocomputing, Security and Society, Arizona State University, Tempe, AZ, USA
Joshua J. Daymude
  • School of Computing and Augmented Intelligence & Biodesign Center for Biocomputing, Security and Society, Arizona State University, Tempe, AZ, USA

Cite AsGet BibTex

Jamison W. Weber, Tishya Chhabra, Andréa W. Richa, and Joshua J. Daymude. Energy-Constrained Programmable Matter Under Unfair Adversaries. In 27th International Conference on Principles of Distributed Systems (OPODIS 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 286, pp. 7:1-7:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.OPODIS.2023.7

Abstract

Individual modules of programmable matter participate in their system’s collective behavior by expending energy to perform actions. However, not all modules may have access to the external energy source powering the system, necessitating a local and distributed strategy for supplying energy to modules. In this work, we present a general energy distribution framework for the canonical amoebot model of programmable matter that transforms energy-agnostic algorithms into energy-constrained ones with equivalent behavior and an 𝒪(n²)-round runtime overhead - even under an unfair adversary - provided the original algorithms satisfy certain conventions. We then prove that existing amoebot algorithms for leader election (ICDCN 2023) and shape formation (Distributed Computing, 2023) are compatible with this framework and show simulations of their energy-constrained counterparts, demonstrating how other unfair algorithms can be generalized to the energy-constrained setting with relatively little effort. Finally, we show that our energy distribution framework can be composed with the concurrency control framework for amoebot algorithms (Distributed Computing, 2023), allowing algorithm designers to focus on the simpler energy-agnostic, sequential setting but gain the general applicability of energy-constrained, asynchronous correctness.

Subject Classification

ACM Subject Classification
  • Theory of computation → Distributed algorithms
  • Theory of computation → Self-organization
Keywords
  • Programmable matter
  • amoebot model
  • energy distribution
  • concurrency

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads

References

  1. Dana Angluin, James Aspnes, Zoë Diamadi, Michael J. Fischer, and René Peralta. Computation in Networks of Passively Mobile Finite-State Sensors. Distributed Computing, 18(4):235-253, 2006. URL: https://doi.org/10.1007/S00446-005-0138-3.
  2. Palina Bartashevich, Doreen Koerte, and Sanaz Mostaghim. Energy-Saving Decision Making for Aerial Swarms: PSO-Based Navigation in Vector Fields. In 2017 IEEE Symposium Series on Computational Intelligence (SSCI), pages 1-8, 2017. URL: https://doi.org/10.1109/SSCI.2017.8285178.
  3. Rida A. Bazzi and Joseph L. Briones. Stationary and Deterministic Leader Election in Self-Organizing Particle Systems. In Stabilization, Safety, and Security of Distributed Systems, volume 11914 of Lecture Notes in Computer Science, pages 22-37, 2019. URL: https://doi.org/10.1007/978-3-030-34992-9_3.
  4. Douglas Blackiston, Emma Lederer, Sam Kriegman, Simon Garnier, Joshua Bongard, and Michael Levin. A Cellular Platform for the Development of Synthetic Living Machines. Science Robotics, 6(52):eabf1571, 2021. URL: https://doi.org/10.1126/scirobotics.abf1571.
  5. Joseph L. Briones, Tishya Chhabra, Joshua J. Daymude, and Andréa W. Richa. Invited Paper: Asynchronous Deterministic Leader Election in Three-Dimensional Programmable Matter. In Proceedings of the 24th International Conference on Distributed Computing and Networking, pages 38-47, 2023. URL: https://doi.org/10.1145/3571306.3571389.
  6. Jason D. Campbell, Padmanabhan Pillai, and Seth Copen Goldstein. The Robot Is the Tether: Active, Adaptive Power Routing for Modular Robots with Unary Inter-Robot Connectors. In 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems, pages 4108-4115, 2005. URL: https://doi.org/10.1109/IROS.2005.1545426.
  7. Joshua J. Daymude, Robert Gmyr, Kristian Hinnenthal, Irina Kostitsyna, Christian Scheideler, and Andréa W. Richa. Convex Hull Formation for Programmable Matter. In Proceedings of the 21st International Conference on Distributed Computing and Networking, pages 2:1-2:10, 2020. URL: https://doi.org/10.1145/3369740.3372916.
  8. Joshua J. Daymude, Robert Gmyr, Andréa W. Richa, Christian Scheideler, and Thim Strothmann. Improved Leader Election for Self-Organizing Programmable Matter. In Algorithms for Sensor Systems, volume 10718 of Lecture Notes in Computer Science, pages 127-140, 2017. URL: https://doi.org/10.1007/978-3-319-72751-6_10.
  9. Joshua J. Daymude, Kristian Hinnenthal, Andréa W. Richa, and Christian Scheideler. Computing by Programmable Particles. In Paola Flocchini, Giuseppe Prencipe, and Nicola Santoro, editors, Distributed Computing by Mobile Entities, volume 11340 of Lecture Notes in Computer Science, pages 615-681. Springer, Cham, 2019. URL: https://doi.org/10.1007/978-3-030-11072-7_22.
  10. Joshua J. Daymude, Andréa W. Richa, and Christian Scheideler. The Canonical Amoebot Model: Algorithms and Concurrency Control. Distributed Computing, 2023. URL: https://doi.org/10.1007/s00446-023-00443-3.
  11. Joshua J. Daymude, Andréa W. Richa, and Jamison W. Weber. Bio-Inspired Energy Distribution for Programmable Matter. In International Conference on Distributed Computing and Networking 2021, pages 86-95, 2021. URL: https://doi.org/10.1145/3427796.3427835.
  12. Zahra Derakhshandeh, Shlomi Dolev, Robert Gmyr, Andréa W. Richa, Christian Scheideler, and Thim Strothmann. Amoebot - A New Model for Programmable Matter. In Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, pages 220-222, 2014. URL: https://doi.org/10.1145/2612669.2612712.
  13. Zahra Derakhshandeh, Robert Gmyr, Andréa W. Richa, Christian Scheideler, and Thim Strothmann. An Algorithmic Framework for Shape Formation Problems in Self-Organizing Particle Systems. In Proceedings of the Second Annual International Conference on Nanoscale Computing and Communication, pages 21:1-21:2, 2015. URL: https://doi.org/10.1145/2800795.2800829.
  14. Zahra Derakhshandeh, Robert Gmyr, Thim Strothmann, Rida Bazzi, Andréa W. Richa, and Christian Scheideler. Leader Election and Shape Formation with Self-Organizing Programmable Matter. In Andrew Phillips and Peng Yin, editors, DNA Computing and Molecular Programming, volume 9211 of Lecture Notes in Computer Science, pages 117-132, 2015. URL: https://doi.org/10.1007/978-3-319-21999-8_8.
  15. Giuseppe A. Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, and Yukiko Yamauchi. Shape Formation by Programmable Particles. Distributed Computing, 33(1):69-101, 2020. URL: https://doi.org/10.1007/S00446-019-00350-6.
  16. Shlomi Dolev, Sergey Frenkel, Michael Rosenblit, Ram Prasadh Narayanan, and K. Muni Venkateswarlu. In-Vivo Energy Harvesting Nano Robots. In 2016 IEEE International Conference on the Science of Electrical Engineering (ICSEE), pages 1-5, 2016. URL: https://doi.org/10.1109/ICSEE.2016.7806107.
  17. Paola Flocchini, Giuseppe Prencipe, and Nicola Santoro, editors. Distributed Computing by Mobile Entities: Current Research in Moving and Computing, volume 11340 of Lecture Notes in Computer Science. Springer, Cham, 2019. URL: https://doi.org/10.1007/978-3-030-11072-7.
  18. Nicolas Gastineau, Wahabou Abdou, Nader Mbarek, and Olivier Togni. Distributed Leader Election and Computation of Local Identifiers for Programmable Matter. In Seth Gilbert, Danny Hughes, and Bhaskar Krishnamachari, editors, Algorithms for Sensor Systems, volume 11410 of Lecture Notes in Computer Science, pages 159-179, 2019. URL: https://doi.org/10.1007/978-3-030-14094-6_11.
  19. Nicolas Gastineau, Wahabou Abdou, Nader Mbarek, and Olivier Togni. Leader Election and Local Identifiers for Three-dimensional Programmable Matter. Concurrency and Computation: Practice and Experience, 34(7):e6067, 2022. URL: https://doi.org/10.1002/CPE.6067.
  20. Kyle Gilpin, Ara Knaian, and Daniela Rus. Robot Pebbles: One Centimeter Modules for Programmable Matter through Self-Disassembly. In 2010 IEEE International Conference on Robotics and Automation, pages 2485-2492, 2010. URL: https://doi.org/10.1109/ROBOT.2010.5509817.
  21. Robert Gmyr, Kristian Hinnenthal, Irina Kostitsyna, Fabian Kuhn, Dorian Rudolph, Christian Scheideler, and Thim Strothmann. Forming Tile Shapes with Simple Robots. Natural Computing, 19(2):375-390, 2020. URL: https://doi.org/10.1007/S11047-019-09774-2.
  22. Seth Copen Goldstein, Jason D. Campbell, and Todd C. Mowry. Programmable Matter. Computer, 38(6):99-101, 2005. URL: https://doi.org/10.1109/MC.2005.198.
  23. Seth Copen Goldstein, Todd C. Mowry, Jason D. Campbell, Michael P. Ashley-Rollman, Michael De Rosa, Stanislav Funiak, James F. Hoburg, Mustafa E. Karagozler, Brian Kirby, Peter Lee, Padmanabhan Pillai, J. Robert Reid, Daniel D. Stancil, and Michael P. Weller. Beyond Audio and Video: Using Claytronics to Enable Pario. AI Magazine, 30(2):29-45, 2009. URL: https://doi.org/10.1609/AIMAG.V30I2.2241.
  24. Serge Kernbach, editor. Handbook of Collective Robotics: Fundamentals and Challenges. Jenny Stanford Publishing, New York, NY, USA, 2013. URL: https://doi.org/10.1201/b14908.
  25. Irina Kostitsyna, Tom Peters, and Bettina Speckmann. Brief Announcement: An Effective Geometric Communication Structure for Programmable Matter. In 36th International Symposium on Distributed Computing (DISC 2022), volume 246 of Leibniz International Proceedings in Informatics (LIPIcs), pages 47:1-47:3, 2022. URL: https://doi.org/10.4230/LIPICS.DISC.2022.47.
  26. Sam Kriegman, Douglas Blackiston, Michael Levin, and Josh Bongard. A Scalable Pipeline for Designing Reconfigurable Organisms. Proceedings of the National Academy of Sciences, 117(4):1853-1859, 2020. URL: https://doi.org/10.1073/PNAS.1910837117.
  27. Bruce J. MacLennan. The Morphogenetic Path to Programmable Matter. Proceedings of the IEEE, 103(7):1226-1232, 2015. URL: https://doi.org/10.1109/JPROC.2015.2425394.
  28. Othon Michail, George Skretas, and Paul G. Spirakis. On the Transformation Capability of Feasible Mechanisms for Programmable Matter. Journal of Computer and System Sciences, 102:18-39, 2019. URL: https://doi.org/10.1016/J.JCSS.2018.12.001.
  29. Sanaz Mostaghim, Christoph Steup, and Fabian Witt. Energy Aware Particle Swarm Optimization as Search Mechanism for Aerial Micro-Robots. In 2016 IEEE Symposium Series on Computational Intelligence (SSCI), pages 1-7, 2016. URL: https://doi.org/10.1109/SSCI.2016.7850263.
  30. Nils Napp, Samuel Burden, and Eric Klavins. Setpoint Regulation for Stochastically Interacting Robots. Autonomous Robots, 30(1):57-71, 2011. URL: https://doi.org/10.1007/S10514-010-9203-2.
  31. Daniel Pickem, Paul Glotfelter, Li Wang, Mark Mote, Aaron Ames, Eric Feron, and Magnus Egerstedt. The Robotarium: A Remotely Accessible Swarm Robotics Research Testbed. In 2017 IEEE International Conference on Robotics and Automation (ICRA), pages 1699-1706, 2017. URL: https://doi.org/10.1109/ICRA.2017.7989200.
  32. Benoit Piranda and Julien Bourgeois. Designing a Quasi-Spherical Module for a Huge Modular Robot to Create Programmable Matter. Autonomous Robots, 42:1619-1633, 2018. URL: https://doi.org/10.1007/S10514-018-9710-0.
  33. Alexandra Porter and Andréa W. Richa. Collaborative Computation in Self-Organizing Particle Systems. In Unconventional Computation and Natural Computation, volume 10867 of Lecture Notes in Computer Science, pages 188-203, 2018. URL: https://doi.org/10.1007/978-3-319-92435-9_14.
  34. Tommaso Toffoli and Norman Margolus. Programmable Matter: Concepts and Realization. Physica D: Nonlinear Phenomena, 47(1-2):263-272, 1991. URL: https://doi.org/10.1016/0167-2789(91)90296-L.
  35. Hongxing Wei, Bin Wang, Yi Wang, Zili Shao, and Keith C.C. Chan. Staying-Alive Path Planning with Energy Optimization for Mobile Robots. Expert Systems with Applications, 39(3):3559-3571, 2012. URL: https://doi.org/10.1016/J.ESWA.2011.09.046.
  36. Damien Woods, Ho-Lin Chen, Scott Goodfriend, Nadine Dabby, Erik Winfree, and Peng Yin. Active Self-Assembly of Algorithmic Shapes and Patterns in Polylogarithmic Time. In Proceedings of the 4th Conference on Innovations in Theoretical Computer Science, pages 353-354, 2013. URL: https://doi.org/10.1145/2422436.2422476.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail