Anzeige
Erschienen in:
2012 | OriginalPaper | Buchkapitel
Gathering an Even Number of Robots in an Odd Ring without Global Multiplicity Detection
verfasst von : Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Sébastien Tixeuil
Erschienen in: Mathematical Foundations of Computer Science 2012
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
We propose a gathering protocol for an
even
number of robots in a ring-shaped network that allows symmetric but not periodic configurations as initial configurations, yet uses only local weak multiplicity detection. Robots are assumed to be anonymous and oblivious, and the execution model is the non-atomic CORDA model with asynchronous fair scheduling. In our scheme, the number of robots
k
must be greater than 8, the number of nodes
n
on a network must be odd and greater than
k
+ 3. The running time of our protocol is
O
(
n
2
) asynchronous rounds.