Line Recovery by Programmable Particles

Shape formation has been recently studied in distributed systems of programmable particles. In this paper we consider the shape recovery problem of restoring the shape when f of the n particles have crashed. We focus on the basic line shape, used as a tool for the construction of more complex configurations. We present a solution to the line recovery problem by the non-faulty anonymous particles; the solution works regardless of the initial distribution and number f < n -4 of faults, of the local orientations of the non-faulty entities, and of the number of non-faulty entities activated in each round (i.e., semi-synchronous adversarial scheduler).

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

[2]  Nicola Santoro,et al.  A Rupestrian Algorithm , 2016, FUN.

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

[4]  Nicola Santoro,et al.  Arbitrary pattern formation by asynchronous, anonymous, oblivious robots , 2008, Theor. Comput. Sci..

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

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

[7]  Tobias Langner,et al.  Solving the ANTS Problem with Asynchronous Finite State Machines , 2014, ICALP.

[8]  Nicola Santoro,et al.  Distributed Computing by Oblivious Mobile Robots , 2012, Synthesis Lectures on Distributed Computing Theory.

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

[10]  Masafumi Yamashita,et al.  Distributed Anonymous Mobile Robots: Formation of Geometric Patterns , 1999, SIAM J. Comput..

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

[12]  山内 由紀子,et al.  Plane Formation by Synchronous Mobile Robots in the Three-Dimensional Euclidean Space , 2019 .

[13]  Yukiko Yamauchi,et al.  Pattern Formation by Oblivious Asynchronous Mobile Robots , 2015, SIAM J. Comput..

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

[15]  Yukiko Yamauchi,et al.  Brief Announcement: Shape Formation by Programmable Particles , 2017, DISC.

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

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

[18]  Nicola Santoro,et al.  Distributed Computing by Mobile Robots: Gathering , 2012, SIAM J. Comput..

[19]  Noa Agmon,et al.  Fault-tolerant gathering algorithms for autonomous mobile robots , 2004, SODA '04.

[20]  Tommaso Toffoli,et al.  Programmable Matter: Concepts and Realization , 1993, Int. J. High Speed Comput..

[21]  Nancy M. Amato,et al.  Distributed reconfiguration of metamorphic robot chains , 2004, PODC '00.

[22]  Shlomi Dolev,et al.  In-vivo energy harvesting nano robots , 2016, 2016 IEEE International Conference on the Science of Electrical Engineering (ICSEE).