On the Synthesis of Mobile Robots Algorithms: the Case of Ring Gathering

Abstract : Recent advances in Distributed Computing highlight models and algorithms for autonomous swarms of mobile robots that self-organize and cooperate to solve global objectives. The overwhelming majority of works so far considers handmade algorithms and correctness proofs. This paper is the first to propose a formal framework to automatically design distributed algorithms that are dedicated to autonomous mobile robots evolving in a discrete space. As a case study, we consider the problem of gathering all robots at a particular location, not known beforehand. Our contribution is threefold. First, we propose an encoding of the gathering problem as a reachability game. Then, we automatically generate an optimal distributed algorithm for three robots evolving on a fixed size uniform ring. Finally, we prove by induction that the generated algorithm is also correct for any ring size except when an impossibility result holds (that is, when the number of robots divides the ring size).
Type de document :
Communication dans un congrès
SSS 2014 - 16th International Symposium on Stabilization, Safety and Security of Distributed Systems, Sep 2014, Paderborn, Germany. Springer, 8756, pp.237-251, 2014, Lecture Notes in Computer Science. <10.1007/978-3-319-11764-5_17>
Liste complète des métadonnées


https://hal.archives-ouvertes.fr/hal-01016832
Contributeur : Laure Millet <>
Soumis le : samedi 5 juillet 2014 - 10:09:59
Dernière modification le : lundi 29 mai 2017 - 14:22:49
Document(s) archivé(s) le : dimanche 5 octobre 2014 - 10:41:07

Fichiers

cont_synth.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Laure Millet, Maria Potop-Butucaru, Nathalie Sznajder, Sébastien Tixeuil. On the Synthesis of Mobile Robots Algorithms: the Case of Ring Gathering. SSS 2014 - 16th International Symposium on Stabilization, Safety and Security of Distributed Systems, Sep 2014, Paderborn, Germany. Springer, 8756, pp.237-251, 2014, Lecture Notes in Computer Science. <10.1007/978-3-319-11764-5_17>. <hal-01016832v2>

Partager

Métriques

Consultations de
la notice

628

Téléchargements du document

99