Distributed circle formation for anonymous oblivious robots

57Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper deals with systems of multiple mobile robots each of which observes the positions of the other robots and moves to a new position so that eventually the robots form a circle. In the model we study, the robots are anonymous and oblivious, in the sense that they cannot be distinguished by their appearance and do not have a common x-y coordinate system, while they are unable to remember past actions. We propose a new distributed algorithm for circle formation on the plane. We prove that our algorithm is correct and provide an upper bound for its performance. In addition, we conduct an extensive and detailed comparative simulation experimental study with the DK algorithm described in [7]. The results show that our algorithm is very simple and takes con-siderably less time to execute than algorithm DK. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Chatzigiannakis, I., Markou, M., & Nikoletseas, S. (2004). Distributed circle formation for anonymous oblivious robots. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3059, 159–174. https://doi.org/10.1007/978-3-540-24838-5_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free