Synchronous Gathering without Multiplicity Detection: a Certified Algorithm

Abstract : In mobile robotic swarms, the gathering problem consists in coordinating all the robots so that in finite time they occupy the same location, not known beforehand. Multiplicity detection refers to the ability to detect that more than one robot can occupy a given position. When the robotic swarm operates synchronously, a well-known result by Cohen and Peleg permits to achieve gathering, provided robots are capable of multiplicity detection. We present a new algorithm for synchronous gathering, that does not assume that robots are capable of multiplicity detection, nor make any other extra assumption. Unlike previous approaches, the correctness of our proof is certified in the model where the protocol is defined, using the Coq proof assistant.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01894618
Contributor : Xavier Urbain <>
Submitted on : Friday, October 12, 2018 - 3:39:32 PM
Last modification on : Thursday, October 17, 2019 - 12:36:59 PM

Identifiers

Citation

Thibaut Balabonski, Amélie Delga, Lionel Rieg, Sébastien Tixeuil, Xavier Urbain. Synchronous Gathering without Multiplicity Detection: a Certified Algorithm. Theory of Computing Systems, Springer Verlag, 2019, 63 (2), pp.200-218. ⟨10.1007/s00224-017-9828-z⟩. ⟨hal-01894618⟩

Share

Metrics

Record views

264