Abstract
In this paper, we investigate the possibility to deterministically solve the gathering problem (GP) with weak robots (anonymous, autonomous, disoriented, oblivious, deaf, and dumb). We introduce strong multiplicity detection as the ability for the robots to detect the exact number of robots located at a given position. We show that with strong multiplicity detection, there exists a deterministic self-stabilizing algorithm solving GP for n robots if, and only if, n is odd. © 2009 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Dieudonné, Y., & Petit, F. (2009). Self-stabilizing deterministic gathering. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5804 LNCS, pp. 230–241). https://doi.org/10.1007/978-3-642-05434-1_23
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
