LIPIcs.OPODIS.2019.24.pdf
- Filesize: 2.5 MB
- 16 pages
Document
Oblivious Permutations on the Plane
Authors
-
Part of:
Volume:
23rd International Conference on Principles of Distributed Systems (OPODIS 2019)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: International Conference on Principles of Distributed Systems (OPODIS) - License:
Creative Commons Attribution 3.0 Unported license
- Publication Date: 2020-02-11
Cite AsGet BibTex
Shantanu Das, Giuseppe A. Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, and Masafumi Yamashita. Oblivious Permutations on the Plane. In 23rd International Conference on Principles of Distributed Systems (OPODIS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 153, pp. 24:1-24:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
https://doi.org/10.4230/LIPIcs.OPODIS.2019.24
https://doi.org/10.4230/LIPIcs.OPODIS.2019.24
Abstract
We consider a distributed system of n identical mobile robots operating in the two dimensional Euclidian plane. As in the previous studies, we consider the robots to be anonymous, oblivious, dis-oriented, and without any communication capabilities, operating based on the Look-Compute-Move model where the next location of a robot depends only on its view of the current configuration. Even in this seemingly weak model, most formation problems which require constructing specific configurations, can be solved quite easily when the robots are fully synchronized with each other. In this paper we introduce and study a new class of problems which, unlike the studied formation problems, cannot always be solved even in the fully synchronous model with atomic and rigid moves. This class of problems requires the robots to permute their locations in the plane. In particular, we are interested in implementing two special types of permutations - permutations without any fixed points and permutations of order n. The former (called Move-All) requires each robot to visit at least two of the initial locations, while the latter (called Visit-All) requires every robot to visit each of the initial locations in a periodic manner. We provide a characterization of the solvability of these problems, showing the main challenges in solving this class of problems for mobile robots. We also provide algorithms for the feasible cases, in particular distinguishing between one-step algorithms (where each configuration must be a permutation of the original configuration) and multi-step algorithms (which allow intermediate configurations). These results open a new research direction in mobile distributed robotics which has not been investigated before.
Subject Classification
ACM Subject Classification
- Theory of computation → Distributed algorithms
- Computer systems organization → Robotics
Keywords
- Distributed Algorithms
- Mobile Robots
- Fully synchronous
- Oblivious
- Permutations
- Chirality
- Sequence of configurations
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads
References
-
H Ando, I Suzuki, and M Yamashita. Formation and agreement problems for synchronous mobile robots with limited visibility. In Proceedings of Tenth International Symposium on Intelligent Control, pages 453,460. IEEE, 1995.
- Quentin Bramas and Sébastien Tixeuil. Brief Announcement: Probabilistic Asynchronous Arbitrary Pattern Formation. In Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, PODC 2016, Chicago, IL, USA, July 25-28, 2016, pages 443-445, 2016. URL: https://doi.org/10.1145/2933057.2933074.
- Serafino Cicerone, Gabriele Di Stefano, and Alfredo Navarra. Asynchronous Embedded Pattern Formation Without Orientation. In Distributed Computing - 30th International Symposium, DISC 2016, Paris, France, September 27-29, 2016. Proceedings, pages 85-98, 2016. URL: https://doi.org/10.1007/978-3-662-53426-7_7.
- Shantanu Das, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, and Masafumi Yamashita. Autonomous mobile robots with lights. Theor. Comput. Sci., 609:171-184, 2016. URL: https://doi.org/10.1016/j.tcs.2015.09.018.
- Shantanu Das, Paola Flocchini, Nicola Santoro, and Masafumi Yamashita. Forming sequences of geometric patterns with oblivious mobile robots. Distributed Computing, 28(2):131-145, 2015. URL: https://doi.org/10.1007/s00446-014-0220-9.
- Paola Flocchini, Giuseppe Prencipe, and Nicola Santoro. Distributed Computing by Oblivious Mobile Robots. Synthesis Lectures on Distributed Computing Theory. Morgan & Claypool Publishers, 2012. URL: https://doi.org/10.2200/S00440ED1V01Y201208DCT010.
- Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, and Peter Widmayer. Arbitrary pattern formation by asynchronous, anonymous, oblivious robots. Theor. Comput. Sci., 407(1-3):412-447, 2008. URL: https://doi.org/10.1016/j.tcs.2008.07.026.
- Nao Fujinaga, Yukiko Yamauchi, Shuji Kijima, and Masafumi Yamashita. Asynchronous Pattern Formation by Anonymous Oblivious Mobile Robots. In Distributed Computing - 26th International Symposium, DISC 2012, Salvador, Brazil, October 16-18, 2012. Proceedings, pages 312-325, 2012. URL: https://doi.org/10.1007/978-3-642-33651-5_22.
- Nao Fujinaga, Yukiko Yamauchi, Hirotaka Ono, Shuji Kijima, and Masafumi Yamashita. Pattern Formation by Oblivious Asynchronous Mobile Robots. SIAM J. Comput., 44(3):740-785, 2015. URL: https://doi.org/10.1137/140958682.
- Giuseppe Antonio Di Luna, Paola Flocchini, Sruti Gan Chaudhuri, Federico Poloni, Nicola Santoro, and Giovanni Viglietta. Mutual visibility by luminous robots without collisions. Inf. Comput., 254:392-418, 2017. URL: https://doi.org/10.1016/j.ic.2016.09.005.
- Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, and Giovanni Viglietta. TuringMobile: A Turing Machine of Oblivious Mobile Robots with Limited Visibility and Its Applications. In 32nd International Symposium on Distributed Computing, DISC 2018, New Orleans, LA, USA, October 15-19, 2018, pages 19:1-19:18, 2018. URL: https://doi.org/10.4230/LIPIcs.DISC.2018.19.
- Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, and Masafumi Yamashita. Meeting in a Polygon by Anonymous Oblivious Robots. In 31st International Symposium on Distributed Computing, DISC 2017, October 16-20, 2017, Vienna, Austria, pages 14:1-14:15, 2017. URL: https://doi.org/10.4230/LIPIcs.DISC.2017.14.
- Giuseppe Antonio Di Luna and Giovanni Viglietta. Robots with Lights. In Distributed Computing by Mobile Entities, Current Research in Moving and Computing, pages 252-277. Springer, 2019. URL: https://doi.org/10.1007/978-3-030-11072-7_11.
- Kazuo Sugihara and Ichiro Suzuki. Distributed algorithms for formation of geometric patterns with many mobile robots. J. Field Robotics, 13(3):127-139, 1996. URL: https://doi.org/10.1002/(SICI)1097-4563(199603)13:3<127::AID-ROB1>3.0.CO;2-U.
- Ichiro Suzuki and Masafumi Yamashita. Distributed Anonymous Mobile Robots: Formation of Geometric Patterns. SIAM J. Comput., 28(4):1347-1363, 1999. URL: https://doi.org/10.1137/S009753979628292X.
- Masafumi Yamashita and Ichiro Suzuki. Characterizing geometric patterns formable by oblivious anonymous mobile robots. Theor. Comput. Sci., 411(26-28):2433-2453, 2010. URL: https://doi.org/10.1016/j.tcs.2010.01.037.
- Yukiko Yamauchi and Masafumi Yamashita. Randomized Pattern Formation Algorithm for Asynchronous Oblivious Mobile Robots. In Distributed Computing - 28th International Symposium, DISC 2014, Austin, TX, USA, October 12-15, 2014. Proceedings, pages 137-151, 2014. URL: https://doi.org/10.1007/978-3-662-45174-8_10.