Synchronous Gathering without Multiplicity Detection: a Certified Algorithm - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Theory of Computing Systems Année : 2019

Synchronous Gathering without Multiplicity Detection: a Certified Algorithm

Résumé

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.
Fichier non déposé

Dates et versions

hal-01894618 , version 1 (12-10-2018)

Identifiants

Citer

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

Altmetric

Partager

Gmail Facebook X LinkedIn More