Distributed Computing by Mobile Robots: Solving the Uniform Circle Formation Problem
Consider a set of n ≠ 4 simple autonomous mobile robots (decentralized, asynchronous, no common coordinate system, no identities, no central coordination, no direct communication, no memory of the past, deterministic) initially in distinct locations, moving freely in the plane and able to sense the positions of the other robots. We study the primitive task of the robots arranging themselves equally spaced along a circle not fixed in advance (Uniform Circle Formation). In the literature, the existing algorithmic contributions are limited to restricted sets of initial configurations of the robots and to more powerful robots. The question of whether such simple robots could deterministically form a uniform circle has remained open. In this paper, we constructively prove that indeed the Uniform Circle Formation problem is solvable for any initial configuration of the robots without any additional assumption. In addition to closing a long-standing problem, the result of this paper also implies that, for pattern formation, asynchrony is not a computational handicap, and that additional powers such as chirality and rigidity are computationally irrelevant.
KeywordsMobile Robot Homology Class Intended Behavior Circle Formation Common Coordinate System
Unable to display preview. Download preview PDF.
- 1.Chatzigiannakis, I., Markou, M., Nikoletseas, S.: Distributed circle formation for anonymous oblivious robots. In: 3rd Workshop on Efficient and Experimental Algorithms, pp. 159–174 (2004)Google Scholar
- 5.S. Das, P. Flocchini, N. Santoro, and M. Yamashita Forming sequences of geometric patterns with oblivious mobile robots. Distributed Computing (to appear, 2014)Google Scholar
- 6.Défago, X., Konagaya, A.: Circle formation for oblivious anonymous mobile robots with no common sense of orientation. In: 2nd ACM Int. Workshop on Principles of Mobile Computing (POMC), pp. 97–104 (2002)Google Scholar
- 8.Dieudonné, Y., Labbani-Igbida, O., Petit, F.: Circle formation of weak mobile robots. ACM Trans. on Autonomous and Adaptive Systems 3(4), 16:1–16:20 (2008)Google Scholar
- 13.Flocchini, P., Prencipe, G., Santoro, N.: Distributed Computing by Oblivious Mobile Robots. Synthesis Lectures on Distributed Computing Theory. Morgan & Claypool (2012)Google Scholar
- 14.Flocchini, P., Prencipe, G., Santoro, N., Viglietta, G.: Distributed Computing by Mobile Robots: Solving the Uniform Circle Formation Problem. arXiv:1407.5917 [cs.DC] (2014)Google Scholar
- 20.Miyamae, T., Ichikawa, S., Hara, F.: Emergent approach to circle formation by multiple autonomous modular robots. J. Robotics and Mechatr. 21(1), 3–11 (2009)Google Scholar
- 21.Oasa, Y., Suzuki, I., Yamashita, M.: A robust distributed convergence algorithm for autonomous mobile robots. In: IEEE Int. Conference on Systems, Man and Cybernetics, pp. 287–292 (1997)Google Scholar