Fault-tolerant gathering algorithms for autonomous mobile robots, SIAM J. Comput, vol.36, issue.1, pp.56-82, 2006. ,
The theory of search games and rendezvous, International Series in Operations Research & Management Science, vol.55, 2003. ,
Distributed memoryless point convergence algorithm for mobile robots with limited visibility, IEEE Trans. Robot. Autom, vol.15, issue.5, pp.818-828, 1999. ,
Synchronous gathering without multiplicity detection: A certified algorithm, Stabilization, Safety, and Security of Distributed Systems-18th International Symposium, vol.10083, pp.7-19, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01894618
Almost optimal asynchronous rendezvous in infinite multidimensional grids, LNCS, vol.6343, pp.297-311, 2010. ,
URL : https://hal.archives-ouvertes.fr/hal-00534263
Asynchronous gathering in rings with 4 robots, Ad-hoc, Mobile, and Wireless Networks-15th International Conference, ADHOC-NOW 2016, vol.9724, pp.311-324, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01340243
Gathering of mobile robots tolerating multiple crash faults, IEEE 33rd International Conference on Distributed Computing Systems, ICDCS 2013, pp.337-346, 2013. ,
DOI : 10.1109/icdcs.2013.27
URL : https://hal.archives-ouvertes.fr/hal-00930074
Wait-free gathering without chirality, Structural Information and Communication Complexity-22nd International Colloquium, SIROCCO 2015, vol.9439, pp.313-327, 2015. ,
DOI : 10.1007/978-3-319-25258-2_22
URL : https://hal.archives-ouvertes.fr/hal-01213285
Distributed computing by mobile robots: Gathering, SIAM J. Comput, vol.41, issue.4, pp.829-879, 2012. ,
DOI : 10.1137/100796534
Convergence properties of the gravitational algorithm in asynchronous robot systems, SIAM J. Comput, vol.34, issue.6, pp.1516-1528, 2005. ,
Tell me where I am so I can meet you sooner (asynchronous rendezvous with location information), LNCS, vol.6199, issue.2, pp.502-514, 2010. ,
DOI : 10.1007/978-3-642-14162-1_42
Certified universal gathering in R 2 for oblivious mobile robots, Distributed Computing-30th International Symposium, DISC 2016, vol.9888, pp.187-200, 2016. ,
DOI : 10.1007/978-3-662-53426-7_14
URL : https://hal.archives-ouvertes.fr/hal-01274295
How to meet asynchronously (almost) everywhere, ACM Transactions on Algorithms, vol.8, issue.4, p.37, 2012. ,
DOI : 10.1137/1.9781611973075.3
URL : https://hal.archives-ouvertes.fr/hal-00418775
Gathering of robots on anonymous grids and trees without multiplicity detection, Theor. Comput. Sci, vol.610, pp.158-168, 2016. ,
How to gather asynchronous oblivious robots on anonymous rings, pp.326-340, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-00728979
Asynchronous deterministic rendezvous in graphs, Theor. Comput. Sci, vol.355, issue.3, pp.315-326, 2006. ,
Fault-tolerant and self-stabilizing mobile robots gathering, pp.46-60, 2006. ,
Anonymous meeting in networks, Algorithmica, vol.74, issue.2, pp.908-946, 2016. ,
How to meet asynchronously at polynomial cost, SIAM J. Comput, vol.44, issue.3, pp.844-867, 2015. ,
Distributed Computing by Oblivious Mobile Robots, 2012. ,
DOI : 10.2200/s00440ed1v01y201208dct010
Gathering of asynchronous robots with limited visibility, Theor. Comput. Sci, vol.337, issue.1-3, pp.147-168, 2005. ,
Asynchronous rendezvous of anonymous agents in arbitrary graphs, OPODIS. LNCS, vol.7109, pp.421-434, 2011. ,
DOI : 10.1007/978-3-642-25873-2_29
Gathering fat mobile robots with slim omnidirectional cameras, Theor. Comput. Sci, vol.557, pp.1-27, 2014. ,
DOI : 10.1016/j.tcs.2014.08.004
URL : https://hal.archives-ouvertes.fr/hal-01151754
Asynchronous mobile robot gathering from symmetric configurations without global multiplicity detection, Structural Information and Communication Complexity-18th International Colloquium, SIROCCO 2011, vol.6796, pp.150-161, 2011. ,
DOI : 10.1007/978-3-642-22212-2_14
URL : https://hal.archives-ouvertes.fr/hal-01285680
Gathering an even number of robots in an odd ring without global multiplicity detection, Mathematical Foundations of Computer Science 2012-37th International Symposium, MFCS 2012, vol.7464, pp.542-553, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-00709074
Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring, Theor. Comput. Sci, vol.411, pp.3235-3246, 2010. ,
URL : https://hal.archives-ouvertes.fr/hal-00519069
Gathering asynchronous oblivious mobile robots in a ring, Theor. Comput. Sci, vol.390, issue.1, pp.27-39, 2008. ,
URL : https://hal.archives-ouvertes.fr/hal-00307234
The mobile agent rendezvous problem in the ring, Synthesis Lectures on Distributed Computing Theory, vol.1, 2010. ,
Mobile agent rendezvous: A survey, LNCS, vol.4056, pp.1-9, 2006. ,
Deterministic rendezvous in networks: A comprehensive survey, Networks, vol.59, issue.3, pp.331-347, 2012. ,
Impossibility of gathering by a set of autonomous mobile robots, Theor. Comput. Sci, vol.384, issue.2-3, pp.222-231, 2007. ,
Asynchronous deterministic rendezvous on the line, SOFSEM. LNCS, vol.5404, pp.497-508, 2009. ,