On the Solvability of Anonymous Partial Grids Exploration by Mobile Robots, Lecture Notes in Computer Science, vol.28, issue.4, pp.428-445, 2008. ,
DOI : 10.1109/AINA.2007.44
URL : https://hal.archives-ouvertes.fr/inria-00277344
Optimal probabilistic ring exploration by asynchronous oblivious robots, Proceedings of Sirocco 2009, 2009. ,
URL : https://hal.archives-ouvertes.fr/hal-01295189
Computing without communicating: Ring exploration by asynchronous oblivious robots, OPODIS, pp.105-118, 2007. ,
URL : https://hal.archives-ouvertes.fr/hal-00339884
Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots, Lecture Notes in Computer Science, vol.5058, pp.33-47, 2008. ,
DOI : 10.1007/978-3-540-69355-0_5
URL : https://hal.archives-ouvertes.fr/hal-00341465
Taking advantage of symmetries: Gathering of asynchronous oblivious robots on a ring, OPODIS, pp.446-462, 2008. ,
URL : https://hal.archives-ouvertes.fr/hal-00342931
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
Instantaneous Actions vs. Full Asynchronicity: Controlling and Coordinating a Sset of Autonomous Mobile Robots, Lecture Notes in Computer Science, vol.2202, pp.154-171, 2001. ,
DOI : 10.1007/3-540-45446-2_10
Distributed Anonymous Mobile Robots: Formation of Geometric Patterns, SIAM Journal on Computing, vol.28, issue.4, pp.1347-1363, 1999. ,
DOI : 10.1137/S009753979628292X