Synchronous Gathering without Multiplicity Detection: a Certified Algorithm

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 oper...

Full description

Saved in:
Bibliographic Details
Published in:Theory of computing systems Vol. 63; no. 2; pp. 200 - 218
Main Authors: Balabonski, Thibaut, Delga, Amélie, Rieg, Lionel, Tixeuil, Sébastien, Urbain, Xavier
Format: Journal Article
Language:English
Published: New York Springer US 01.02.2019
Springer Nature B.V
Springer Verlag
Subjects:
ISSN:1432-4350, 1433-0490
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1432-4350
1433-0490
DOI:10.1007/s00224-017-9828-z