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

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:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!