ABSTRACT
We study the computational power of a distributed system consisting of simple autonomous robots moving on the plane. The robots are endowed with visual perception but do not have any means of explicit communication with each other, and have no memory of the past. In the extensive literature it has been shown how such simple robots can form a single geometric pattern (e.g., a line, a circle, etc), however arbitrary, in spite of their obliviousness. This brings to the front the natural research question: what are the real computational limits imposed by the robots being oblivious? In particular, since obliviousness limits what can be remembered, under what conditions can oblivious robots form a series of geometric patterns? Notice that a series of patterns would create some form of memory in an otherwise memory-less system. In this paper we examine and answer this question showing that, under particular conditions, oblivious robot systems can indeed form series of geometric patterns starting from any arbitrary configuration. More precisely, we study the series of patterns that can be formed by robot systems under various restrictions such as anonymity, asynchrony and lack of common orientation. These results are the first strong indication that oblivious solutions may be obtained also for tasks that intuitively seem to require memory.
- N. Agmon and D. Peleg. Fault-tolerant gathering algorithms for autonomous mobile robots. SIAM J. on Computing, 36(1):56--82, 2006. Google ScholarDigital Library
- H. Ando, S. Fujita, I. Suzuki, and M. Yamashita. Formation and agreement problems for synchronous mobile robots with limited visibility. In IEEE Symposium of Intelligent Control, pages 453--460, 1995.Google ScholarCross Ref
- H. Ando, Y. Oasa, I. Suzuki, and M. Yamashita. A distributed memoryless point convergence algorithm for mobile robots with limited visibility. IEEE Transaction on Robotics and Automation, 15(5):818--828, 1999.Google ScholarCross Ref
- Y. Asahiro, S. Fujita, I. Suzuki, and M. Yamashita. A self-stabilizing marching algorithm for a group of oblivious robots. In 12th Int. Conf. on Principles of Distributed Systems (OPODIS), pages 125--144, 2008. Google ScholarDigital Library
- F. Bullo, J. Cortés, and S. Martínez. Distributed Control of Robotic Networks. Applied Mathematics Series. Princeton University Press, 2009. Electronically available at http://coordinationbook.info. Google ScholarDigital Library
- I. Chatzigiannakis, M. Markou, and S. E. Nikoletseas. Distributed circle formation for anonymous oblivious robots. In 3rd Workshop on Efficient and Experimental Algorithms (WEA), pages 159--174, 2004.Google ScholarCross Ref
- M. Cieliebak, P. Flocchini, G. Prencipe, and N. Santoro. Solving the robots gathering problem. In Automata, Languages and Programming, 30th International Colloquium, (ICALP'03), pages 1181--1196, 2003. Google ScholarDigital Library
- R. Cohen and D. Peleg. Convergence properties of the gravitational algorithm in asynchronous robot systems. SIAM J. on Computing, 34(6):1516--1528, 2005. Google ScholarDigital Library
- R. Cohen and D. Peleg. Local spreading algorithms for autonomous robot systems. Theoretical Computer Science, 399(1--2):71--82, 2008. Google ScholarDigital Library
- J. Czyzowicz, L. Gasieniec, and A. Pelc. Gathering few fat mobile robots in the plane. Theoretical Computer Science, 410(6-7):481--499, 2009. Google ScholarDigital Library
- X. Défago, M. Gradinariu, S. Messika, and P. R. Parvédy. Fault-tolerant and self-stabilizing mobile robots gathering. In 20th Int. Symposium on Distributed Computing (DISC), pages 46--60, 2006. Google ScholarDigital Library
- X. Défago and S. Souissi. Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformity. Theoretical Computer Science, 396(1-3):97--112, 2008. Google ScholarDigital Library
- Y. Dieudonné, S. Dolev, F. Petit, and M. Segal. Deaf, dumb, and chatting asynchronous robots. In 13th Int. Conf. on Principles of Distributed Systems (OPODIS), pages 71--85, 2009. Google ScholarDigital Library
- Y. Dieudonné, O. Labbani-Igbida, and F. Petit. Circle formation of weak mobile robots. ACM Transactions on Autonomous and Adaptive Systems, 3(4), 2008. Google ScholarDigital Library
- A. Efrima and D. Peleg. Distributed models and algorithms for mobile robot systems. In 33rd Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), pages 70--87, 2007. Google ScholarDigital Library
- P. Flocchini, G. Prencipe, and N. Santoro. Self-deployment of mobile sensors on a ring. Theoretical Computer Science, 402(1):67--80, 2008. Algorithmic Aspects of Wireless Sensor Networks. Google ScholarDigital Library
- P. Flocchini, G. Prencipe, N. Santoro, and P. Widmayer. Gathering of asynchronous robots with limited visibility. Theoretical Computer Science, 337(1-3):147--168, 2005. Google ScholarDigital Library
- P. Flocchini, G. Prencipe, N. Santoro, and P. Widmayer. Arbitrary pattern formation by asynchronous, anonymous, oblivious robots. Theoretical Computer Science, 407(1-3):412--447, 2008. Google ScholarDigital Library
- J. Lin, A. S. Morse, and B. D. O. Anderson. The multi-agent rendezvous problem. parts 1 and 2. SIAM J. on Control and Optimization, 46(6):2120--2147, 2007. Google ScholarDigital Library
- S. Souissi, X. Défago, and M. Yamashita. Using eventually consistent compasses to gather memory-less mobile robots with limited visibility. ACM Transactions on Autonomous and Adaptive Systems, 4(1), 2009. Google ScholarDigital Library
- K. Sugihara and I. Suzuki. Distributed algorithms for formation of geometric patterns with many mobile robots. Journal of Robotics Systems, 13:127--139, 1996.Google ScholarCross Ref
- I. Suzuki and M. Yamashita. Distributed anonymous mobile robots: Formation of geometric patterns. SIAM J. on Computing, 28(4):1347--1363, 1999. Google ScholarDigital Library
- M. Yamashita and I. Suzuki. Characterizing geometric patterns formable by oblivious anonymous mobile robots. Theoretical Computer Science, 411(26-28):2433--2453, 2010. Google ScholarDigital Library
Index Terms
- On the computational power of oblivious robots: forming a series of geometric patterns
Recommendations
Forming sequences of geometric patterns with oblivious mobile robots
We study the computational power of distributed systems consisting of simple autonomous robots moving on the plane. The robots are endowed with visual perception, allowing them to see each other, but they do not have any means of explicit communication ...
Round-Optimal Oblivious Transfer and MPC from Computational CSIDH
Public-Key Cryptography – PKC 2023AbstractWe present the first round-optimal and plausibly quantum-safe oblivious transfer (OT) and multi-party computation (MPC) protocols from the computational CSIDH assumption – the weakest and most widely studied assumption in the CSIDH family of ...
Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
From an engineering point of view, the problem of coordinating a set of autonomous, mobile robots for the purpose of cooperatively performing a task has been studied extensively over the past decade. In contrast, in this paper we aim to understand the ...
Comments