S. Albers and M. R. Henzinger, Exploring Unknown Environments, SIAM Journal on Computing, vol.29, issue.4, pp.1164-1188, 2000.
DOI : 10.1137/S009753979732428X
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.36.42

H. Ando, Y. Oasa, I. Suzuki, and M. Yamashita, Distributed memoryless point convergence algorithm for mobile robots with limited visibility, IEEE Transactions on Robotics and Automation, vol.15, issue.5, pp.818-828, 1999.
DOI : 10.1109/70.795787

M. Cieliebak, P. Flocchini, G. Prencipe, and N. Santoro, Solving the Robots Gathering Problem, Proc. 30th Int. Colloquium on Automata, Languages and Programming (ICALP 2003), pp.1181-1196
DOI : 10.1007/3-540-45061-0_90

R. Cohen and D. Peleg, Local Algorithms for Autonomous Robot Systems, Proc. 13th International Colloquium on Structural Information and Communication Complexity, pp.29-43, 2006.
DOI : 10.1007/11780823_4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.158.7605

J. Czyzowicz, L. Gasieniec, and A. Pelc, Gathering few fat mobile robots in the plane, Proc. 10th International Conference on Principles of Distributed Systems (OPODIS 2006), pp.744-753

A. Dessmark and A. Pelc, Optimal graph exploration without good maps, Theoretical Computer Science, vol.326, issue.1-3, pp.343-362, 2004.
DOI : 10.1016/j.tcs.2004.07.031
URL : http://dx.doi.org/10.1016/j.tcs.2004.07.031

R. Fleischer and G. Trippen, Exploring an Unknown Graph Efficiently, Proc. 13th Annual European Symposium on Algorithms (ESA 2005), pp.11-22
DOI : 10.1007/11561071_4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.120.7651

P. Flocchini, D. Ilcinkas, A. Pelc, and N. Santoro, Computing without communicating: Ring exploration by asynchronous oblivious robots, Proc. 11th International Conference on Principles of Distributed Systems, pp.105-118, 2007.
DOI : 10.1007/978-3-540-77096-1_8
URL : https://hal.archives-ouvertes.fr/hal-00339884

P. Flocchini, G. Prencipe, N. Santoro, and P. Widmayer, Gathering of asynchronous robots with limited visibility, Theoretical Computer Science, vol.337, issue.1-3, pp.147-168, 2005.
DOI : 10.1016/j.tcs.2005.01.001

L. Gasieniec, A. Pelc, T. Radzik, and X. Zhang, Tree exploration with logarithmic memory, Proc. 18th Annual ACM-SIAM Symposium on Discrete Algorithms, pp.585-594, 2007.

R. Klasing, E. Markou, and A. Pelc, Gathering asynchronous oblivious mobile robots in a ring, Theoretical Computer Science, vol.390, issue.1, pp.27-39, 2008.
DOI : 10.1016/j.tcs.2007.09.032
URL : https://hal.archives-ouvertes.fr/hal-00307234

P. Panaite and A. Pelc, Exploring Unknown Undirected Graphs, Journal of Algorithms, vol.33, issue.2, pp.281-295, 1999.
DOI : 10.1006/jagm.1999.1043

G. Prencipe, Impossibility of gathering by a set of autonomous mobile robots, Theoretical Computer Science, vol.384, issue.2-3, pp.222-231, 2007.
DOI : 10.1016/j.tcs.2007.04.023

S. Souissi, X. Défago, and M. Yamashita, Gathering Asynchronous Mobile Robots with Inaccurate Compasses, Proc. 10th Int. Conf. on Principles of Distributed Systems (OPODIS 2006), pp.333-349
DOI : 10.1007/11945529_24

K. Sugihara and I. Suzuki, Distributed algorithms for formation of geometric patterns with many mobile robots, Journal of Robotic Systems, vol.1, issue.10, pp.3-127, 1996.
DOI : 10.1002/(SICI)1097-4563(199603)13:3<127::AID-ROB1>3.0.CO;2-U

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