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á bibliografie

Vydáno v:	Theory of computing systems Ročník 63; číslo 2; s. 200 - 218
Hlavní autoři:	Balabonski, Thibaut, Delga, Amélie, Rieg, Lionel, Tixeuil, Sébastien, Urbain, Xavier
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.02.2019 Springer Nature B.V Springer Verlag
Témata:	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 přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!