A Certified Universal Gathering Algorithm for Oblivious Mobile Robots

Pierre Courtieu 1, 2 Lionel Rieg 3 Sébastien Tixeuil 4, 5, 6, 7, 8 Xavier Urbain 9, 10
1 GALLIUM - Langages de programmation, types, compilation et preuves
Inria de Paris
2 CEDRIC - Centre d'études et de recherche en informatique et communications
3 CdF - Collège de France
4 LIP6 - Laboratoire d'Informatique de Paris 6
5 UPMC - Université Pierre et Marie Curie - Paris 6
6 NPA - Networks and Performance Analysis
LIP6 - Laboratoire d'Informatique de Paris 6
7 IUF - Institut Universitaire de France
8 LINCS - Laboratory of Information, Network and Communication Sciences
9 LRI - Laboratoire de Recherche en Informatique
10 ENSIIE - Ecole Nationale Supérieure d'Informatique pour l'Industrie et l'Entreprise
Abstract : We present a new algorithm for the problem of universal gathering mobile oblivious robots (that is, starting from any initial configuration that is not bivalent, using any number of robots, the robot reach in a finite number of steps the same position, not known beforehand) without relying on a common chirality. We give very strong guaranties on the correctness of our algorithm by proving formally that it is correct, using the Coq proof assistant. To our knowledge, this is the first certified positive (and constructive) result in the context of oblivious mobile robots. It demonstrates both the effectiveness of the approach to obtain new algorithms that are truly generic, and its manageability since the amount of developed code remains human readable.
Document type :
Conference papers
Complete list of metadatas
https://hal.sorbonne-universite.fr/hal-01349061
Contributor : Sébastien Tixeuil <>
Submitted on : Tuesday, July 26, 2016 - 3:53:10 PM
Last modification on : Monday, February 3, 2020 - 2:10:03 PM

Identifiers

  • HAL Id : hal-01349061, version 1

Collections

UPMC | CNRS | CNAM | INSTITUT-TELECOM | UMR8623 | LIP6 | INRIA | PSL | TDS-MACS | CENTRALESUPELEC | UNIV-PARIS-SACLAY | LRI-VALS | UNIV-HESAM | SORBONNE-UNIVERSITE | CEDRIC-CNAM | SU-SCIENCES

Citation

Pierre Courtieu, Lionel Rieg, Sébastien Tixeuil, Xavier Urbain. A Certified Universal Gathering Algorithm for Oblivious Mobile Robots. Distributed Computing (DISC), Sep 2016, Paris, France. ⟨hal-01349061⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

713

Contact

Informations

CCSD