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

B. Awerbuch, M. Betke, R. L. Rivest, and M. Singh, Piecemeal Graph Exploration by a Mobile Robot, Information and Computation, vol.152, issue.2, pp.155-172, 1999.
DOI : 10.1006/inco.1999.2795
URL : http://doi.org/10.1006/inco.1999.2795

M. A. Bender and D. Slonim, The power of team exploration: two robots can learn unlabeled directed graphs, Proceedings 35th Annual Symposium on Foundations of Computer Science, pp.75-85, 1974.
DOI : 10.1109/SFCS.1994.365703

L. Budach and L. Automata, Automata and Labyrinths, Mathematische Nachrichten, vol.7, issue.4, pp.195-282, 1948.
DOI : 10.1002/mana.19780860120

S. Dobrev, J. Jansson, K. Sadakane, and W. K. Sung, Finding Short Right-Hand-on-the-Wall Walks in Undirected Graphs, Proc. of the 12th Colloquium on Structural Information and Communication Complexity (SIROCCO'05), pp.127-139, 2005.

P. Flocchini, D. Ilcinkas, A. Pelc, N. Santoro, and . #4878, Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots, Proc. 11th Int'l Conference On Principles Of Distributed Systems (OPODIS'07), pp.105-118, 2007.
DOI : 10.1007/978-3-540-77096-1_8
URL : https://hal.archives-ouvertes.fr/hal-00339884

P. Fraigniaud, D. Ilcinkas, G. Peer, A. Pelc, and D. Peleg, Graph exploration by a finite automaton, Theoretical Computer Science, vol.345, issue.2-3, pp.331-344, 2005.
DOI : 10.1016/j.tcs.2005.07.014
URL : https://hal.archives-ouvertes.fr/hal-00339763

P. Fraigniaud, D. Ilcinkas, S. Rajsbaum, and S. Tixeuil, Space Lower Bounds for Graph Exploration via Reduced Automata, Proc. 12th Colloquium on Structural Information and Communication Complexity (SIROCCO'05), pp.140-154, 2005.
DOI : 10.1007/11429647_13
URL : https://hal.archives-ouvertes.fr/hal-00339766

L. Gasieniec, R. Klasing, R. A. Martin, A. Navarra, X. Zhang et al., Fast Periodic Graph Exploration with Constant Memory, Proc. 14th Colloquium on Structural Information and Communication Complexity, pp.26-40, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00306994

R. Grossi, A. Pietracaprina, and G. Pucci, Optimal Deterministic Protocols for Mobile Robots on a Grid, Information and Computation, vol.173, issue.2, pp.132-142, 2002.
DOI : 10.1006/inco.2000.3004
URL : http://doi.org/10.1006/inco.2000.3004

D. Ilcinkas, Setting Port Numbers for Fast Graph Exploration, Proc. 13th Colloquium on Structural Information and Communication Complexity (SIROCCO'06), pp.59-69, 2006.
DOI : 10.1007/11780823_6
URL : https://hal.archives-ouvertes.fr/hal-00339843

P. Panaite and A. Pelc, Impact of topographic information on graph exploration efficiency, Networks, vol.28, issue.2, pp.96-103, 2000.
DOI : 10.1002/1097-0037(200009)36:2<96::AID-NET4>3.0.CO;2-N

H. A. Rollik, Automata in planar graphs, Acta Informatica, vol.4, issue.3, pp.287-298, 1980.
DOI : 10.1007/BF00288647

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

R. Yared, X. Defago, and M. Wiesmann, Collision prevention using group communication for asynchronous cooperative mobile robots, 21st International Conference on Advanced Networking and Applications (AINA '07), pp.244-249, 2007.
DOI : 10.1109/AINA.2007.44