A Certified Universal Gathering Algorithm for Oblivious Mobile Robots

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 robots 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 managability since the amount of developped code remains human readable.
Complete list of metadatas

Cited literature [17 references]  Display  Hide  Download

https://hal.sorbonne-universite.fr/hal-01159890
Contributor : Sébastien Tixeuil <>
Submitted on : Thursday, June 4, 2015 - 9:51:50 AM
Last modification on : Tuesday, May 14, 2019 - 10:14:15 AM
Long-term archiving on : Tuesday, September 15, 2015 - 10:46:45 AM

Files

hal.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution - NonCommercial 4.0 International License

Identifiers

  • HAL Id : hal-01159890, version 1
  • ARXIV : 1506.01603

Citation

Pierre Courtieu, Lionel Rieg, Sébastien Tixeuil, Xavier Urbain. A Certified Universal Gathering Algorithm for Oblivious Mobile Robots. [Research Report] UPMC, Sorbonne Universites CNRS; CNAM, Paris; College de France; Université Paris Sud. 2015. ⟨hal-01159890⟩

Share

Metrics

Record views

1532

Files downloads

212