Certified Gathering of Oblivious Mobile Robots: Survey of Recent Results and Open Problems

Swarms of mobile robots have recently attracted the focus of the Distributed Computing community. One of the fundamental problems in this context is that of gathering the robots: the robots must meet at a common location, not known beforehand. Despite its apparent simplicity, this problem proved quite hard to characterise fully, due to many model variants, leading to informal error-prone reasoning.

[1]  Giuseppe Prencipe,et al.  Impossibility of gathering by a set of autonomous mobile robots , 2007, Theor. Comput. Sci..

[2]  Reuven Cohen,et al.  Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems , 2005, SIAM J. Comput..

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

[4]  Sébastien Tixeuil,et al.  Certified Impossibility Results for Byzantine-Tolerant Mobile Robots , 2013, SSS.

[5]  Sébastien Tixeuil,et al.  Gathering of Mobile Robots Tolerating Multiple Crash Faults , 2013, 2013 IEEE 33rd International Conference on Distributed Computing Systems.

[6]  Sébastien Tixeuil,et al.  A Certified Universal Gathering Algorithm for Oblivious Mobile Robots , 2015, ArXiv.

[7]  Yukiko Yamauchi,et al.  Asynchronous Pattern Formation by Anonymous Oblivious Mobile Robots , 2012, DISC.

[8]  Sébastien Tixeuil,et al.  Impossibility of gathering, a certification , 2015, Inf. Process. Lett..

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

[10]  Aniello Murano,et al.  Verification of Asynchronous Mobile-Robots in Partially-Known Environments , 2015, PRIMA.

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

[12]  Ha Thi Thu Doan,et al.  Model Checking of a Mobile Robots Perpetual Exploration Algorithm , 2016, SOFL+MSVL.

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

[14]  Maria Gradinariu Potop-Butucaru,et al.  Formal verification of mobile robot protocols , 2016, Distributed Computing.

[15]  Sébastien Tixeuil,et al.  Wait-Free Gathering Without Chirality , 2015, SIROCCO.

[16]  Xavier Défago,et al.  Discovering and Assessing Fine-Grained Metrics in Robot Networks Protocols , 2012, 2014 IEEE 33rd International Symposium on Reliable Distributed Systems Workshops.

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

[18]  Pascal Raymond,et al.  Optimal Grid Exploration by Asynchronous Oblivious Robots , 2011, SSS.

[19]  Yukiko Yamauchi,et al.  Pattern Formation by Mobile Robots with Limited Visibility , 2013, SIROCCO.

[20]  Masafumi Yamashita,et al.  Characterizing geometric patterns formable by oblivious anonymous mobile robots , 2010, Theor. Comput. Sci..

[21]  Maria Gradinariu Potop-Butucaru,et al.  On the Synthesis of Mobile Robots Algorithms: The Case of Ring Gathering , 2014, SSS.

[22]  Sébastien Tixeuil,et al.  Synchronous Gathering Without Multiplicity Detection: A Certified Algorithm , 2016, SSS.

[23]  Sébastien Tixeuil,et al.  Certified Universal Gathering in \mathbb R ^2 for Oblivious Mobile Robots , 2016, DISC.

[24]  Franck Petit,et al.  Self-stabilizing gathering with strong multiplicity detection , 2012, Theor. Comput. Sci..

[25]  Maria Gradinariu Potop-Butucaru,et al.  RoboCast: Asynchronous Communication in Robot Networks , 2010, OPODIS.