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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theory of computing systems Jg. 63; H. 2; S. 200 - 218
Hauptverfasser:	Balabonski, Thibaut, Delga, Amélie, Rieg, Lionel, Tixeuil, Sébastien, Urbain, Xavier
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.02.2019 Springer Nature B.V Springer Verlag
Schlagworte:	Algorithms Computer Science Distributed, Parallel, and Cluster Computing Logic in Computer Science Robots Safety Security of Distributed Systems (SSS 2016) Special Issue on Stabilization Studies Theory of Computation Proof assistant Gathering Mobile robots Certification Multiplicity detection
ISSN:	1432-4350, 1433-0490
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!