Gathering an even number of robots in an odd ring without global multiplicity detection

Authors:
Sayaka Kamei;Anissa Lamani;Fukuhito Ooshita;Sébastien Tixeuil
Affiliations:
Dept. of Information Engineering, Hiroshima University, Japan;MIS, Jules Verne University, Amiens, France;Graduate School of Information Science and Technology, Osaka University, Japan;LIP6-CNRS 7606, Université Pierre et Marie Curie - Paris 6, France
Venue:
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Year:
2012

Citing 5
Cited 1

Gathering asynchronous oblivious mobile robots in a ring

Theoretical Computer Science
Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring

Theoretical Computer Science
Asynchronous mobile robot gathering from symmetric configurations without global multiplicity detection

SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Gathering of six robots on anonymous symmetric rings

SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Mobile robots gathering algorithm with local weak multiplicity in rings

SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity

A distributed algorithm for gathering many fat mobile robots in the plane

Proceedings of the 2013 ACM symposium on Principles of distributed computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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(n2) asynchronous rounds.