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

Celý popis

Podrobná bibliografia

Vydané v:	Theory of computing systems Ročník 63; číslo 2; s. 200 - 218
Hlavní autori:	Balabonski, Thibaut, Delga, Amélie, Rieg, Lionel, Tixeuil, Sébastien, Urbain, Xavier
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.02.2019 Springer Nature B.V Springer Verlag
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!