A Certified Universal Gathering Algorithm for Oblivious Mobile Robots - Sorbonne Université Access content directly
Reports (Research Report) Year : 2015

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.
Fichier principal
Vignette du fichier
hal.pdf (120.56 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01159890 , version 1 (04-06-2015)

Licence

Attribution - NonCommercial

Identifiers

Cite

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⟩
1127 View
158 Download

Altmetric

Share

Gmail Facebook X LinkedIn More