Distributed Computing

, Volume 28, Issue 2, pp 131–145 | Cite as

Forming sequences of geometric patterns with oblivious mobile robots

  • Shantanu Das
  • Paola Flocchini
  • Nicola Santoro
  • Masafumi Yamashita
Article

Abstract

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 with each other. Further the robots are oblivious, meaning that they always act based on their current perception of the environment, and they have no memory of the past. Such system of simple robots have been studied extensively with the objective of achieving coordinated tasks e.g. arranging the robots in a line or a circle. In fact it has been shown that obliviousness is not a limiting factor to form a single geometric pattern, however arbitrary. This paper aims to understand the computational limits imposed by the obliviousness of the robots by studying the formation of a series of geometric patterns instead of a single pattern. If such a series of patterns could be formed this would create some form of memory in an otherwise memory-less system. We show that, under particular conditions, oblivious robot systems can indeed form a given series of geometric patterns starting from any arbitrary configuration. More precisely, we characterize the series of patterns that can be formed by oblivious robot systems under various additional restrictions such as anonymity, asynchrony and lack of common orientation. These results provide strong indications that oblivious solutions may be obtained also for tasks that intuitively seem to require memory.

Keywords

Distributed coordination Autonomous mobile robots  Pattern formation Oblivious Semi-synchronous Sequence of patterns 

References

  1. 1.
    Agmon, N., Peleg, D.: Fault-tolerant gathering algorithms for autonomous mobile robots. SIAM J. Comput. 36(1), 56–82 (2006)CrossRefMATHMathSciNetGoogle Scholar
  2. 2.
    Ando, H., Oasa, Y., Suzuki, I., Yamashita, M.: A distributed memoryless point convergence algorithm for mobile robots with limited visibility. IEEE Trans. Robotics Autom. 15(5), 818–828 (1999)CrossRefGoogle Scholar
  3. 3.
    Ando, H., Suzuki, I., Yamashita, M.: Formation and agreement problems for synchronous mobile robots with limited visibility. In: IEEE Symposium on Intelligent Control, pp. 453–460 (1995)Google Scholar
  4. 4.
    Asahiro, Y., Fujita, S., Suzuki, I., Yamashita, M.: A self-stabilizing marching algorithm for a group of oblivious robots. In: 12th International Conference on Principles of Distributed Systems (OPODIS), pp. 125–144 (2008)Google Scholar
  5. 5.
    Bouzid, Z., Lamani, A.: Robot networks with homonyms: the case of patterns formation. arXiv, Report, 1105.5817 (2011)Google Scholar
  6. 6.
    Bullo, F., Cortés, J., Martínez, S.: Distrib. Control Robotic Netw. Princeton University Press, Princeton (2009)Google Scholar
  7. 7.
    Chatzigiannakis, I., Markou, M., Nikoletseas, S. E.: Distributed circle formation for anonymous oblivious robots. In: 3rd Workshop on Efficient and Experimental Algorithms (WEA), pp. 159–174 (2004)Google Scholar
  8. 8.
    Cieliebak, M., Flocchini, P., Prencipe, G., Santoro, N.: Distributed computing by mobile robots: gathering. SIAM J. Comput. 41(4), 829–879 (2012)CrossRefMATHMathSciNetGoogle Scholar
  9. 9.
    Cohen, R., Peleg, D.: Local spreading algorithms for autonomous robot systems. Theor. Comput. Sci. 399(1–2), 71–82 (2008)CrossRefMATHMathSciNetGoogle Scholar
  10. 10.
    Défago, X., Souissi, S.: Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformity. Theor. Comput. Sci. 396(1–3), 97–112 (2008)CrossRefMATHGoogle Scholar
  11. 11.
    Dieudonné, Y., Dolev, S., Petit, F., Segal, M.: Deaf, dumb, and chatting asynchronous robots. In 13th International Conference on Principles of Distributed Systems (OPODIS), pp. 71–85 (2009)Google Scholar
  12. 12.
    Dieudonné, Y., Labbani-Igbida, O., Petit, F.: Circle formation of weak mobile robots. ACM Trans. Auton. Adapt. Syst. 3(4), 16:1–16:20 (2008)Google Scholar
  13. 13.
    Efrima, A., Peleg, D.: Distributed models and algorithms for mobile robot systems. In: 33rd Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), pp. 70–87 (2007)Google Scholar
  14. 14.
    Flocchini, P., Prencipe, G., Santoro, N.: Distributed Computing by Oblivious Mobile Robots. Morgan & Claypool, San Rafael (2012)Google Scholar
  15. 15.
    Flocchini, P., Prencipe, G., Santoro, N., Widmayer, P.: Gathering of asynchronous robots with limited visibility. Theor. Comput. Sci. 337(1–3), 147–168 (2005)CrossRefMATHMathSciNetGoogle Scholar
  16. 16.
    Flocchini, P., Prencipe, G., Santoro, N., Widmayer, P.: Arbitrary pattern formation by asynchronous, anonymous, oblivious robots. Theor. Comput. Sci. 407(1–3), 412–447 (2008)CrossRefMATHMathSciNetGoogle Scholar
  17. 17.
    Fujinaga, N., Ono, H., Kijima, S., Yamashita, M.: Pattern formation through optimum matching by oblivious corda robots. In: 14th International Conference on Principles of Distributed Systems (OPODIS), pp. 1–15 (2010)Google Scholar
  18. 18.
    Fujinaga, N., Yamauchi, Y., Kijima, S., Yamashita, M.: Asynchronous pattern formation by anonymous oblivious mobile robots. In: Proceedings of the 26th International Symposium on Distributed Computing (DISC), pp. 312–325 (2012)Google Scholar
  19. 19.
    Gervasi, V., Prencipe, G.: Coordination without communication: the case of the flocking problem. Discret. Appl. Math. 144(3), 324–344 (2004) Google Scholar
  20. 20.
    Gordon, N., Wagner, I. A., Bruckstein, A. M.: Discrete bee dance algorithms for pattern formation on a grid. In: IEEE/WIC International Conference on Intelligent Agent Technology (IAT), pp. 545–549 (2003)Google Scholar
  21. 21.
    Izumi, T., Izumi, T., Kamei, S., Ooshita, F.: Feasibility of polynomial-time randomized gathering for oblivious mobile robots. IEEE Trans. Parallel Distrib. Syst. 24(4), 716–723 (2013)CrossRefGoogle Scholar
  22. 22.
    Izumi, T., Katayama, Y., Inuzuka, N., Wada, K.: Gathering autonomous mobile robots with dynamic compasses: an optimal result. In: 21st International Symposium on Distributed Computing (DISC), pp. 298–312 (2007)Google Scholar
  23. 23.
    Lin, J., Morse, A.S., Anderson, B.D.O.: The multi-agent rendezvous problem. Parts 1 and 2. SIAM J. Control Optim. 46(6), 2120–2147 (2007)CrossRefMATHMathSciNetGoogle Scholar
  24. 24.
    Souissi, S., Izumi, T., Wada, K.: Oracle-based flocking of mobile robots in crash-recovery model. Theor. Comput. Sci. 412(33), 4350–4360 (2011)CrossRefMATHMathSciNetGoogle Scholar
  25. 25.
    Sugihara, K., Suzuki, I.: Distributed algorithms for formation of geometric patterns with many mobile robots. J. Robotics Syst. 13, 127–139 (1996)CrossRefMATHGoogle Scholar
  26. 26.
    Suzuki, I., Yamashita, M.: Distributed anonymous mobile robots: formation of geometric patterns. SIAM J. Comput. 28(4), 1347–1363 (1999)CrossRefMATHMathSciNetGoogle Scholar
  27. 27.
    Yamashita, M., Suzuki, I.: Characterizing geometric patterns formable by oblivious anonymous mobile robots. Theor. Comput. Sci. 411(26–28), 2433–2453 (2010)CrossRefMATHMathSciNetGoogle Scholar
  28. 28.
    Yamauchi, Y., Yamashita, M.: Pattern formation by mobile robots with limited visibility. In: 20th International Colloquium on Structural Information and Communication Complexity (SIROCCO), pp. 201–212 (2013)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  • Shantanu Das
    • 1
  • Paola Flocchini
    • 2
  • Nicola Santoro
    • 3
  • Masafumi Yamashita
    • 4
  1. 1.LIFAix-Marseille University and CNRSMarseilleFrance
  2. 2.School of Electrical Engineering and Computer ScienceUniversity of OttawaOttawaCanada
  3. 3.School of Computer ScienceCarleton UniversityOttawaCanada
  4. 4.Department of Computer Science and Communication EngineeringKyushu UniversityFukuokaJapan

Personalised recommendations