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. © 2012 Springer-Verlag.
CITATION STYLE
Kamei, S., Lamani, A., Ooshita, F., & Tixeuil, S. (2012). Gathering an even number of robots in an odd ring without global multiplicity detection. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7464 LNCS, pp. 542–553). https://doi.org/10.1007/978-3-642-32589-2_48
Mendeley helps you to discover research relevant for your work.