LIPIcs.SAND.2024.20.pdf
- Filesize: 0.99 MB
- 17 pages
Document
Space and Move-Optimal Arbitrary Pattern Formation on Infinite Rectangular Grid by Oblivious Robot Swarm
Authors
Avisek Sharma 
,
Satakshi Ghosh ,
Pritam Goswami ,
Buddhadeb Sau
-
Part of:
Volume:
3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: Symposium on Algorithmic Foundations of Dynamic Networks (SAND) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2024-05-31
File
Document Identifiers
Author Details
Cite AsGet BibTex
Avisek Sharma, Satakshi Ghosh, Pritam Goswami, and Buddhadeb Sau. Space and Move-Optimal Arbitrary Pattern Formation on Infinite Rectangular Grid by Oblivious Robot Swarm. In 3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 292, pp. 20:1-20:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.SAND.2024.20
https://doi.org/10.4230/LIPIcs.SAND.2024.20
Abstract
Arbitrary Pattern Formation (APF) is a fundamental coordination problem in swarm robotics. It requires a set of autonomous robots (mobile computing units) to form an arbitrary pattern (given as input) starting from any initial pattern. This problem has been extensively investigated in continuous and discrete scenarios, with this study focusing on the discrete variant. A set of robots is placed on the nodes of an infinite rectangular grid graph embedded in the euclidean plane. The movements of each robot is restricted to one of the four neighboring grid nodes from its current position. The robots are autonomous, anonymous, identical, and homogeneous, and operate Look-Compute-Move cycles. In this work, we adopt the classical OBLOT robot model, meaning the robots have no persistent memory or explicit communication methods, yet they possess full and unobstructed visibility. This work proposes an algorithm that solves the APF problem in a fully asynchronous scheduler assuming the initial configuration is asymmetric. The considered performance measures of the algorithm are space and number of moves required for the robots. The algorithm is asymptotically move-optimal. Here, we provide a definition of space complexity that takes the visibility issue into consideration. We observe an obvious lower bound 𝒟 of the space complexity and show that the proposed algorithm has the space complexity 𝒟+4. On comparing with previous related works, we show that this is the first proposed algorithm considering OBLOT robot model that is asymptotically move-optimal and has the least space complexity which is almost optimal.
Subject Classification
ACM Subject Classification
- Theory of computation → Distributed algorithms
Keywords
- Distributed algorithms
- Oblivious robots
- Optimal algorithms
- Swarm robotics
- Space optimization
- and Rectangular grid
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads
References
- Kaustav Bose, Ranendu Adhikary, Manash Kumar Kundu, and Buddhadeb Sau. Arbitrary pattern formation on infinite grid by asynchronous oblivious robots. Theoretical Computer Science, 815:213-227, 2020. URL: https://doi.org/10.1016/j.tcs.2020.02.016.
- Kaustav Bose, Archak Das, and Buddhadeb Sau. Pattern formation by robots with inaccurate movements. In Quentin Bramas, Vincent Gramoli, and Alessia Milani, editors, 25th International Conference on Principles of Distributed Systems, OPODIS 2021, December 13-15, 2021, Strasbourg, France, volume 217 of LIPIcs, pages 10:1-10:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. URL: https://doi.org/10.4230/LIPIcs.OPODIS.2021.10.
- Quentin Bramas and Sébastien Tixeuil. Probabilistic asynchronous arbitrary pattern formation (short paper). In Borzoo Bonakdarpour and Franck Petit, editors, Stabilization, Safety, and Security of Distributed Systems - 18th International Symposium, SSS 2016, Lyon, France, November 7-10, 2016, Proceedings, volume 10083 of Lecture Notes in Computer Science, pages 88-93, 2016. URL: https://doi.org/10.1007/978-3-319-49259-9_7.
- Quentin Bramas and Sébastien Tixeuil. Arbitrary pattern formation with four robots. In Taisuke Izumi and Petr Kuznetsov, editors, Stabilization, Safety, and Security of Distributed Systems - 20th International Symposium, SSS 2018, Tokyo, Japan, November 4-7, 2018, Proceedings, volume 11201 of Lecture Notes in Computer Science, pages 333-348. Springer, 2018. URL: https://doi.org/10.1007/978-3-030-03232-6_22.
- Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, and Alfredo Navarra. Arbitrary pattern formation on infinite regular tessellation graphs. Theor. Comput. Sci., 942:1-20, 2023. URL: https://doi.org/10.1016/j.tcs.2022.11.021.
- Serafino Cicerone, Gabriele Di Stefano, and Alfredo Navarra. Embedded pattern formation by asynchronous robots without chirality. Distributed Comput., 32(4):291-315, 2019. URL: https://doi.org/10.1007/s00446-018-0333-7.
- Yoann Dieudonné, Franck Petit, and Vincent Villain. Leader election problem versus pattern formation problem. In Nancy A. Lynch and Alexander A. Shvartsman, editors, Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings, volume 6343 of Lecture Notes in Computer Science, pages 267-281. Springer, 2010. URL: https://doi.org/10.1007/978-3-642-15763-9_26.
- 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.
- Satakshi Ghosh, Pritam Goswami, Avisek Sharma, and Buddhadeb Sau. Move optimal and time optimal arbitrary pattern formations by asynchronous robots on infinite grid. International Journal of Parallel, Emergent and Distributed Systems, 0(0):1-23, 2022. URL: https://doi.org/10.1080/17445760.2022.2124411.
- Rory Hector, Gokarna Sharma, Ramachandran Vaidyanathan, and Jerry L. Trahan. Optimal arbitrary pattern formation on a grid by asynchronous autonomous robots. In 2022 IEEE International Parallel and Distributed Processing Symposium, IPDPS 2022, Lyon, France, May 30 - June 3, 2022, pages 1151-1161. IEEE, 2022. URL: https://doi.org/10.1109/IPDPS53621.2022.00115.
- Manash Kumar Kundu, Pritam Goswami, Satakshi Ghosh, and Buddhadeb Sau. Arbitrary pattern formation by asynchronous opaque robots on infinite grid. CoRR, abs/2205.03053, 2022. URL: https://doi.org/10.48550/arXiv.2205.03053.
- Manash Kumar Kundu, Pritam Goswami, Satakshi Ghosh, and Buddhadeb Sau. Arbitrary pattern formation by opaque fat robots on infinite grid. International Journal of Parallel, Emergent and Distributed Systems, 37(5):542-570, 2022. URL: https://doi.org/10.1080/17445760.2022.2088750.
- Brati Mondal, Pritam Goswami, Avisek Sharma, and Buddhadeb Sau. Arbitrary pattern formation on a continuous circle by oblivious robot swarm. In Proceedings of the 25th International Conference on Distributed Computing and Networking, ICDCN 2024, Chennai, India, January 4-7, 2024, pages 94-103. ACM, 2024. URL: https://doi.org/10.1145/3631461.3631545.
- Avisek Sharma, Satakshi Ghosh, Pritam Goswami, and Buddhadeb Sau. Space and move-optimal arbitrary pattern formation on infinite rectangular grid by oblivious robot swarm. CoRR, abs/2309.11190, 2023. URL: https://doi.org/10.48550/arXiv.2309.11190.
- Avisek Sharma, Satakshi Ghosh, Pritam Goswami, and Buddhadeb Sau. Space and move-optimal arbitrary pattern formation on a rectangular grid by robot swarms. In Proceedings of the 25th International Conference on Distributed Computing and Networking, ICDCN 2024, Chennai, India, January 4-7, 2024, pages 65-73. ACM, 2024. URL: https://doi.org/10.1145/3631461.3631542.
- Ichiro Suzuki and Masafumi Yamashita. Distributed anonymous mobile robots: Formation of geometric patterns. SIAM Journal on Computing, 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. Theoretical Computer Science, 411(26):2433-2453, 2010. URL: https://doi.org/10.1016/j.tcs.2010.01.037.