Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots, Symposium on Discrete Algorithms: Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, pp.1070-1078, 2004. ,
DOI : 10.1137/050645221
Optimal Byzantine Resilient Convergence in Asynchronous Robots Networks, p.651, 2009. ,
DOI : 10.1007/978-3-642-05118-0_12
Robot Convergence via Center-of-Gravity Algorithms, Proc. of the 11th Int. Colloquium on Structural Information and Communication Complexity, pp.79-88, 2004. ,
DOI : 10.1007/978-3-540-27796-5_8
Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems, SIAM Journal on Computing, vol.34, issue.6, pp.1516-1528, 2005. ,
DOI : 10.1137/S0097539704446475
Fault-Tolerant and Self-stabilizing Mobile Robots Gathering, DISC06, the 20th International Conference on Distributed Computing, pp.46-60, 2006. ,
DOI : 10.1007/11864219_4
URL : https://hal.archives-ouvertes.fr/hal-01352106
Reaching approximate agreement in the presence of faults, Journal of the ACM, vol.33, issue.3, pp.499-516, 1986. ,
DOI : 10.1145/5925.5931
Corda: Distributed coordination of a set of autonomous mobile robots, Proc. 4th European Research Seminar on Advances in Distributed Systems (ERSADS'01), pp.185-190, 2001. ,
On the Feasibility of Gathering by Autonomous Mobile Robots, Proc. Structural Information and Communication Complexity, 12th Intl Coll., SIROCCO 2005, pp.246-261, 2005. ,
DOI : 10.1007/11429647_20
Distributed Anonymous Mobile Robots: Formation of Geometric Patterns, SIAM Journal on Computing, vol.28, issue.4, pp.1347-1363, 1999. ,
DOI : 10.1137/S009753979628292X