N. Agmon and D. Peleg, Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots, SIAM Journal on Computing, vol.36, issue.1, pp.56-82, 2006.
DOI : 10.1137/050645221
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.102.4666

C. Auger, Z. Bouzid, P. Courtieu, S. Tixeuil, and X. Urbain, Certified Impossibility Results for Byzantine-Tolerant Mobile Robots, Stabilization, Safety, and Security of Distributed Systems -15th International Symposium, SSS 2013 Proceedings, pp.178-190, 2013.
DOI : 10.1007/978-3-319-03089-0_13
URL : https://hal.archives-ouvertes.fr/hal-01126335

T. Balabonski, A. Delga, L. Rieg, S. Tixeuil, and X. Urbain, Synchronous Gathering Without Multiplicity Detection: A Certified Algorithm, Stabilization, Safety, and Security of Distributed Systems -18th International Symposium, SSS 2016 Proceedings, volume 10083 of Lecture Notes in Computer Science, pp.7-19, 2016.
DOI : 10.1137/S009753979628292X
URL : https://hal.archives-ouvertes.fr/hal-01491813

B. Bérard, P. Lafourcade, L. Millet, and M. Potop-butucaru, Yann Thierry-Mieg, and Sébastien Tixeuil. Formal verification of mobile robot protocols, Distributed Computing, 2016.

S. Bhagat, S. Gan-chaudhuri, and K. Mukhopadhyaya, Fault-Tolerant Gathering of Asynchronous Oblivious Mobile Robots under One-Axis Agreement, WALCOM: Algorithms and Computation -9th International Workshop , WALCOM 2015 Proceedings, pp.149-160, 2015.
DOI : 10.1007/978-3-319-15612-5_14

F. Bonnet, X. Défago, F. Petit, M. Potop-butucaru, and S. Tixeuil, Discovering and Assessing Fine-Grained Metrics in Robot Networks Protocols, 2014 IEEE 33rd International Symposium on Reliable Distributed Systems Workshops, pp.50-59, 2014.
DOI : 10.1109/SRDSW.2014.34
URL : https://hal.archives-ouvertes.fr/hal-00934186

Z. Bouzid, S. Das, and S. Tixeuil, Gathering of Mobile Robots Tolerating Multiple Crash Faults, 2013 IEEE 33rd International Conference on Distributed Computing Systems, pp.337-346, 2013.
DOI : 10.1109/ICDCS.2013.27
URL : https://hal.archives-ouvertes.fr/hal-00930074

Q. Bramas and S. Tixeuil, Wait-Free Gathering Without Chirality, Structural Information and Communication Complexity -22nd Intl. Colloquium (SIROCCO), Post- Proceedings, pp.313-327, 2015.
DOI : 10.1137/S009753979628292X
URL : https://hal.archives-ouvertes.fr/hal-01213285

P. Courtieu, L. Rieg, S. Tixeuil, and X. Urbain, Impossibility of gathering, a certification, Information Processing Letters, vol.115, issue.3, pp.447-452, 2015.
DOI : 10.1016/j.ipl.2014.11.001
URL : https://hal.archives-ouvertes.fr/hal-00995126

P. Courtieu, L. Rieg, S. Tixeuil, and X. Urbain, Certified universal gathering in \mathbb R ?2 for oblivious mobile robots, Distributed Computing -30th International Symposium, DISC 2016 Proceedings, volume 9888 of Lecture Notes in Computer Science, pp.187-200, 2016.
DOI : 10.1007/978-3-662-53426-7_14

S. Das, P. Flocchini, G. Prencipe, N. Santoro, and M. Yamashita, Autonomous mobile robots with lights, Theoretical Computer Science, vol.609, pp.171-184, 2016.
DOI : 10.1016/j.tcs.2015.09.018

X. Défago, M. Gradinariu-potop-butucaru, and J. Clément, Stéphane Messika, and Philippe Raipin-Parvédy. Fault and byzantine tolerant self-stabilizing mobile robots gathering, Japan Adv. Inst. of Science and Tech. (JAIST), 2015.

X. Défago, M. Gradinariu-potop-butucaru, S. Messika, and P. Raipin-parvédy, Fault-Tolerant and Self-stabilizing Mobile Robots Gathering, Proc. 20th Intl. Symp. Distributed Computing (DISC), volume LNCS 4167, pp.46-60, 2006.
DOI : 10.1007/11864219_4

S. Devismes, A. Lamani, F. Petit, P. Raymond, and S. Tixeuil, Optimal Grid Exploration by Asynchronous Oblivious Robots, Stabilization, Safety, and Security of Distributed Systems -14th International Symposium, SSS 2012 Proceedings, pp.64-76, 2012.
DOI : 10.1007/978-3-642-33536-5_7
URL : https://hal.archives-ouvertes.fr/hal-00934161

Y. Dieudonné and F. Petit, Self-stabilizing gathering with strong multiplicity detection, Theoretical Computer Science, vol.428, pp.47-57, 2012.
DOI : 10.1016/j.tcs.2011.12.010

H. T. , T. Doan, F. Bonnet, and K. Ogata, Model checking of a mobile robots perpetual exploration algorithm, Structured Object-Oriented Formal Language and Method -6th International Workshop, SOFL+MSVL 2016, pp.201-219, 2016.

P. Flocchini, G. Prencipe, and N. Santoro, Distributed Computing by Oblivious Mobile Robots. Synthesis Lectures on Distributed Computing Theory, 2012.
DOI : 10.2200/s00440ed1v01y201208dct010

L. Millet, M. Potop-butucaru, N. Sznajder, and S. Tixeuil, On the Synthesis of Mobile Robots Algorithms: The Case of Ring Gathering, Pascal Felber and Vijay K
DOI : 10.1007/978-3-319-11764-5_17
URL : https://hal.archives-ouvertes.fr/hal-01016832

T. Okumura, K. Wada, and Y. Katayama, Optimal asynchronous rendezvous for mobile robots with lights, 2017.

A. Sangnier, N. Sznajder, M. Potop-butucaru, and S. Tixeuil, Parameterized verification of algorithms for oblivious robots on a ring, Formal Methods in Computer Aided Design, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01540339

I. Suzuki and M. Yamashita, Distributed Anonymous Mobile Robots: Formation of Geometric Patterns, SIAM Journal on Computing, vol.28, issue.4, pp.1347-1363, 1999.
DOI : 10.1137/S009753979628292X
URL : http://cc.ee.ntu.edu.tw/~ncslab/StudyGroup/MultiAgentFormation/SuYa9904FormationPatterns.pdf

G. Viglietta, Rendezvous of Two Robots with Visible Bits, Algorithms for Sensor Systems: 9th International Symposium on Algorithms and Experiments for Sensor Systems , Wireless Networks and Distributed Robotics, pp.291-306, 2013.
DOI : 10.1007/978-3-642-45346-5_21
URL : http://arxiv.org/abs/1211.6039