N. Agmon and D. Peleg, Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots, SIAM Journal on Computing, vol.36, issue.1, p.5882, 2006.
DOI : 10.1137/050645221

E. Bampas, J. Czyzowicz, L. G¡sieniec, D. Ilcinkas, and A. Labourel, Almost optimal asynchronous rendezvous in innite multidimensional grids, Proc. of the 24th International Symposium on Distributed Computing (DISC), p.297311, 2010.

L. Blin, J. Burman, and N. Nisse, Exclusive graph searching, Proc. of the 21st Annual European Symposium on Algorithms (ESA), p.181192, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00845530

L. Blin, A. Milani, M. Potop-butucaru, and S. Tixeuil, Exclusive Perpetual Ring Exploration without Chirality, Proc. of the 24th International Symposium on Distributed Computing (DISC), p.312327, 2010.
DOI : 10.1007/978-3-642-15763-9_29

URL : https://hal.archives-ouvertes.fr/hal-00992700

F. Bonnet, A. Milani, M. Potop-butucaru, and S. Tixeuil, Asynchronous Exclusive Perpetual Grid Exploration without Sense of Direction, 15th Int. Conf. On Principles Of Distributed Systems (OPODIS), p.251265
DOI : 10.1007/978-3-642-25873-2_18

URL : https://hal.archives-ouvertes.fr/hal-00992679

J. Chalopin and S. Das, Rendezvous of Mobile Agents without Agreement on Local Orientation, Proc of the 37th International Colloquium on Automata, Languages and Programming (ICALP), pp.515-526, 2010.
DOI : 10.1007/978-3-642-14162-1_43

URL : https://hal.archives-ouvertes.fr/hal-01198883

J. Chalopin, P. Flocchini, B. Mans, and N. Santoro, Network Exploration by Silent and Oblivious Robots, 36th International Workshop on Graph Theoretic Concepts in Computer Science (WG), p.208219, 2010.
DOI : 10.1137/S009753979628292X

URL : https://hal.archives-ouvertes.fr/hal-01198880

M. Cieliebak, P. Flocchini, G. Prencipe, and N. Santoro, Distributed Computing by Mobile Robots: Gathering, SIAM Journal on Computing, vol.41, issue.4, p.829879, 2012.
DOI : 10.1137/100796534

J. Czyzowicz, L. G¡sieniec, and A. Pelc, Gathering few fat mobile robots in the plane, Theoretical Computer Science, vol.410, issue.6-7, pp.481-499, 2009.
DOI : 10.1016/j.tcs.2008.10.005

D. Angelo, G. , D. Stefano, G. Klasing, R. Navarra et al., Gathering of robots on anonymous grids and trees without multiplicity detection, Theoretical Computer Science, vol.610, p.158168, 2016.

D. Angelo, G. , D. Stefano, G. Navarra, and A. , Gathering asynchronous and oblivious robots on basic graph topologies under the look-compute-move model, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00755407

D. Angelo, G. , D. Stefano, G. Navarra, and A. , Gathering on rings under the look-compute-move model, Distributed Computing, vol.27, issue.4, p.255285, 2014.

D. Angelo, G. , D. Stefano, G. Navarra, and A. , Gathering six oblivious robots on anonymous symmetric rings, Journal of Discrete Algorithms, vol.26, p.1627, 2014.

D. Angelo, G. , D. Stefano, G. Navarra, A. Nisse et al., Computing on rings by oblivious robots: A unied approach for dierent tasks, Algorithmica, vol.4, issue.72, p.10551096, 2015.

D. Angelo, G. Navarra, A. Nisse, and N. , Gathering and exclusive searching on rings under minimal assumptions, Proc. of the 15th International Conference on Distributed Computing and Networking (ICDCN), pp.149-164, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00931514

D. Stafano, G. Navarra, and A. , Gathering of oblivious robots on innite grids with minimum traveled distance

D. Stefano, G. Montanari, P. Navarra, and A. , About Ungatherability of Oblivious and Asynchronous Robots on Anonymous Rings, Proc. of the 26th International Workshop on Combinatorial Algorithms (IWOCA'15), pp.136-147, 2016.
DOI : 10.1007/978-3-319-29516-9_12

Y. Dieudonne, A. Pelc, and D. Peleg, Gathering despite mischief, Proc. of the 23rd ACM-SIAM Symposium on Discrete Algorithms (SODA), p.527540, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01008764

P. Flocchini, D. Ilcinkas, A. Pelc, and N. Santoro, Remembering without memory: Tree exploration by asynchronous oblivious robots, Theoretical Computer Science, vol.411, pp.14-15, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00341465

P. Flocchini, D. Ilcinkas, A. Pelc, and N. Santoro, How many oblivious robots can explore a line, Information Processing Letters, vol.111, issue.20, p.10271031, 2011.
DOI : 10.1016/j.ipl.2011.07.018

URL : https://hal.archives-ouvertes.fr/hal-00643668

P. Flocchini, D. Ilcinkas, A. Pelc, and N. Santoro, Computing without communicating: Ring exploration by asynchronous oblivious robots, Algorithmica, vol.65, issue.3, p.562583, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00339884

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

P. Flocchini, G. Prencipe, N. Santoro, and P. Widmayer, Hard Tasks for Weak Robots: The Role of Common Knowledge in Pattern Formation by Autonomous Mobile Robots, 10th Int. Symp. on Algorithms and Computation (ISAAC), p.93102, 1999.
DOI : 10.1007/3-540-46632-0_10

F. V. Fomin and D. M. Thilikos, An annotated bibliography on guaranteed graph searching, Theoretical Computer Science, vol.399, issue.3, p.236245, 2008.
DOI : 10.1016/j.tcs.2008.02.040

D. Ilcinkas, N. Nisse, and D. Soguet, The cost of monotonicity in distributed graph searching, Distributed Computing, vol.22, issue.2, p.117127, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00341415

T. Izumi, T. Izumi, S. Kamei, and F. Ooshita, Mobile Robots Gathering Algorithm with Local Weak Multiplicity in Rings, Proc. of the 17th International Colloquium on Structural Information and Communication Complexity (SIROCCO), p.101113, 2010.
DOI : 10.1007/978-3-642-13284-1_9

T. Izumi, S. Souissi, Y. Katayama, N. Inuzuka, X. Défago et al., The Gathering Problem for Two Oblivious Robots with Unreliable Compasses, SIAM Journal on Computing, vol.41, issue.1, p.2646, 2012.
DOI : 10.1137/100797916

S. Kamei, A. Lamani, F. Ooshita, and S. Tixeuil, Asynchronous mobile robot gathering from symmetric congurations, Proc. of the 18th International Colloquium on Structural Information and Communication Complexity (SIROCCO), p.150161, 2011.

S. Kamei, A. Lamani, F. Ooshita, and S. Tixeuil, Gathering an Even Number of Robots in an Odd Ring without Global Multiplicity Detection, Proc. of the 37th International Symposium on Mathematical Foundations of Computer Science (MFCS), p.542553, 2012.
DOI : 10.1007/978-3-642-32589-2_48

URL : https://hal.archives-ouvertes.fr/hal-00934132

R. Klasing, A. Kosowski, and A. Navarra, Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring, Theoretical Computer Science, vol.411, issue.34-36, p.32353246, 2010.
DOI : 10.1016/j.tcs.2010.05.020

URL : https://hal.archives-ouvertes.fr/hal-00519069

R. Klasing, E. Markou, and A. Pelc, Gathering asynchronous oblivious mobile robots in a ring, Theoretical Computer Science, vol.390, p.2739, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00307234

E. Kranakis, D. Krizanc, and E. Markou, The Mobile Agent Rendezvous Problem in the Ring, Synthesis Lectures on Distributed Computing Theory, vol.1, issue.1, 2010.
DOI : 10.2200/S00278ED1V01Y201004DCT001

G. Prencipe, Instantaneous Actions vs. Full Asynchronicity: Controlling and Coordinating a Sset of Autonomous Mobile Robots, Proc. of the 7th Italian Conference on Theoretical Computer Science (ICTCS), p.154171, 2001.
DOI : 10.1007/3-540-45446-2_10