Computing by Programmable Particles

The vision for programmable matter is to realize a physical substance that is scalable, versatile, instantly reconfigurable, safe to handle, and robust to failures. Programmable matter could be deployed in a variety of domain spaces to address a wide gamut of problems, including applications in construction, environmental science, synthetic biology, and space exploration. However, there are considerable engineering and computational challenges that must be overcome before such a system could be implemented. Towards developing efficient algorithms for novel programmable matter behaviors, the amoebot model for self-organizing particle systems and its variant, hybrid programmable matter, provide formal computational frameworks that facilitate rigorous algorithmic research. In this chapter, we discuss distributed algorithms under these models for shape formation, shape recognition, object coating, compression, shortcut bridging, and separation in addition to some underlying algorithmic primitives.

[1]  Gregory S. Chirikjian,et al.  Modular Self-Reconfigurable Robot Systems [Grand Challenges of Robotics] , 2007, IEEE Robotics & Automation Magazine.

[2]  Christian Scheideler,et al.  Improved Leader Election for Self-organizing Programmable Matter , 2017, ALGOSENSORS.

[3]  David Doty,et al.  Theory of algorithmic self-assembly , 2012, CACM.

[4]  Christian Scheideler,et al.  Universal Shape Formation for Programmable Matter , 2016, SPAA.

[5]  Anthony Bonato,et al.  The Game of Cops and Robbers on Graphs , 2011 .

[6]  N. Pierce,et al.  A synthetic DNA walker for molecular transport. , 2004, Journal of the American Chemical Society.

[7]  Christian Scheideler,et al.  Convex Hull Formation for Programmable Matter , 2018, ICDCN.

[8]  S. K. Tsang,et al.  Hard-square lattice gas , 1980 .

[9]  Dimitrios M. Thilikos,et al.  An annotated bibliography on guaranteed graph searching , 2008, Theor. Comput. Sci..

[10]  Christian Scheideler,et al.  Universal coating for programmable matter , 2016, Theor. Comput. Sci..

[11]  Erol Sahin,et al.  Swarm Robotics: From Sources of Inspiration to Domains of Application , 2004, Swarm Robotics.

[12]  Wei Li,et al.  A cargo-sorting DNA robot , 2017, Science.

[13]  Christian Scheideler,et al.  Leader Election and Shape Formation with Self-organizing Programmable Matter , 2015, DNA.

[14]  Nathan J. Mlot,et al.  Fire ants self-assemble into waterproof rafts to survive floods , 2011, Proceedings of the National Academy of Sciences.

[15]  Kurt Mehlhorn,et al.  Physarum can compute shortest paths , 2011, SODA.

[16]  Ruojie Sha,et al.  A Bipedal DNA Brownian Motor with Coordinated Legs , 2009, Science.

[17]  Dana Randall,et al.  PR ] 3 N ov 2 01 6 Phase Coexistence for the Hard-Core Model on Z 2 , 2016 .

[18]  Matthew J. Patitz.  An introduction to tile-based self-assembly and a survey of recent results , 2014, Natural Computing.

[19]  Christian Scheideler,et al.  Shape Recognition by a Finite Automaton Robot , 2018, MFCS.

[20]  P. Visscher,et al.  House-hunting by honey bee swarms: collective decisions and individual behaviors , 1999, Insectes Sociaux.

[21]  Dana Randall,et al.  A Markov Chain Algorithm for Compression in Self-Organizing Particle Systems , 2016, PODC.

[22]  Erik Winfree,et al.  Molecular robots guided by prescriptive landscapes , 2010, Nature.

[23]  Dana Randall,et al.  Clustering in Interfering Binary Mixtures , 2011, APPROX-RANDOM.

[24]  Nancy A. Lynch,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[25]  Dana Randall,et al.  A Local Stochastic Algorithm for Separation in Heterogeneous Self-Organizing Particle Systems , 2018, APPROX-RANDOM.

[26]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .

[27]  Robert Gmyr,et al.  Distributed algorithms for overlay networks and programmable matter , 2018 .

[28]  Yukiko Yamauchi,et al.  Shape formation by programmable particles , 2017, Distributed Computing.

[29]  Erik Winfree,et al.  Active self-assembly of algorithmic shapes and patterns in polylogarithmic time , 2013, ITCS '13.

[30]  Simon Garnier,et al.  Army ants dynamically adjust living bridges in response to a cost–benefit trade-off , 2015, Proceedings of the National Academy of Sciences.

[31]  Nicola Santoro,et al.  Line Recovery by Programmable Particles , 2018, ICDCN.

[32]  Jonathan Bath,et al.  A DNA-based molecular motor that can navigate a network of tracks. , 2012, Nature nanotechnology.

[33]  W. K. Hastings,et al.  Monte Carlo Sampling Methods Using Markov Chains and Their Applications , 1970 .

[34]  Dana Randall,et al.  A stochastic approach to shortcut bridging in programmable matter , 2018, Natural Computing.

[35]  T. Schelling.  Models of Segregation , 1969 .

[36]  N. Margolus,et al.  Programmable Matter: Concepts and Realization , 1991, International journal of high speed computing.

[37]  T. Latty,et al.  Collective behaviour and swarm intelligence in slime moulds. , 2016, FEMS microbiology reviews.

[38]  A. Kirman,et al.  A physical analogue of the Schelling model , 2006, Proceedings of the National Academy of Sciences.

[39]  Christian Scheideler,et al.  Amoebot - a new model for programmable matter , 2014, SPAA.

[40]  Christian Scheideler,et al.  An Algorithmic Framework for Shape Formation Problems in Self-Organizing Particle Systems , 2015, NANOCOM.

[41]  Jinwoo Shin,et al.  Improved mixing condition on the grid for counting and sampling independent sets , 2013 .

[42]  Michael J. Fischer,et al.  Computation in networks of passively mobile finite-state sensors , 2004, PODC '04.

[43]  J. Deneubourg,et al.  Self-organized aggregation in cockroaches , 2005, Animal Behaviour.

[44]  Frank Hoffmann.  One Pebble Does Not Suffice to Search Plane Labyrinths , 1981, FCT.

[45]  Christian Scheideler,et al.  J ul 2 01 3 Ameba-inspired Self-organizing Particle Systems ( Extended Abstract ) , 2014 .

[46]  Thomas C. Schelling,et al.  Dynamic models of segregation , 1971 .

[47]  Andrzej Pelc,et al.  Deterministic rendezvous in networks: A comprehensive survey , 2012, Networks.

[48]  Dana Randall,et al.  Phototactic supersmarticles , 2018, Artificial Life and Robotics.

[49]  Shantanu Das,et al.  Mobile agents in distributed computing: Network exploration , 2013, Bull. EATCS.

[50]  Alan M. Frieze,et al.  Torpid mixing of some Monte Carlo Markov chain algorithms in statistical physics , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[51]  Gregory S. Chirikjian,et al.  Kinematics of a metamorphic robotic system , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[52]  Andréa W. Richa,et al.  Collaborative Computation in Self-Organizing Particle Systems , 2018, UCNC.

[53]  Manuel Blum,et al.  On the power of the compass (or, why mazes are easier to search than graphs) , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[54]  Nancy M. Amato,et al.  Algorithms for fast concurrent reconfiguration of hexagonal metamorphic robots , 2005, IEEE Transactions on Robotics.

[55]  Sudheer Sahu,et al.  Autonomous programmable DNA nanorobotic devices using DNAzymes , 2009, Theor. Comput. Sci..

[56]  Christian Scheideler,et al.  On the runtime of universal coating for programmable matter , 2016, Natural Computing.

[57]  Christian Scheideler,et al.  Forming tile shapes with simple robots , 2018, Natural Computing.