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.
Liste complète des métadonnées


http://hal.upmc.fr/hal-01159890
Contributeur : Sébastien Tixeuil <>
Soumis le : jeudi 4 juin 2015 - 09:51:50
Dernière modification le : lundi 29 mai 2017 - 14:27:13
Document(s) archivé(s) le : mardi 15 septembre 2015 - 10:46:45

Fichiers

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

Licence


Distributed under a Creative Commons Paternité - Pas d'utilisation commerciale 4.0 International License

Identifiants

  • 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>

Partager

Métriques

Consultations de
la notice

622

Téléchargements du document

120