Space and Move-optimal Arbitrary Pattern Formation on Infinite Rectangular Grid by Oblivious Robot Swarm (2309.11190v2)
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 $\mathcal{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 $\mathcal{D}$ of the space complexity and show that the proposed algorithm has the space complexity $\mathcal{D}+4$. On comparing with previous related works, we show that this is the first proposed algorithm considering $\mathcal{OBLOT}$ robot model that is asymptotically move-optimal and has the least space complexity which is almost optimal.
- 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.
- 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.
- 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.
- 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.
- Arbitrary pattern formation on infinite regular tessellation graphs. Theor. Comput. Sci., 942:1–20, 2023. doi:10.1016/j.tcs.2022.11.021.
- 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.
- 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.
- 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.
- 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, arXiv:https://doi.org/10.1080/17445760.2022.2124411.
- Optimal arbitrary pattern formation on a grid by asynchronous autonomous robots. In 2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS), pages 1151–1161, 2022. doi:10.1109/IPDPS53621.2022.00115.
- Arbitrary pattern formation by asynchronous opaque robots on infinite grid, 2022. URL: https://arxiv.org/abs/2205.03053.
- 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, arXiv:https://doi.org/10.1080/17445760.2022.2088750.
- 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. doi:10.1145/3631461.3631545.
- 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. doi:10.1145/3631461.3631542.
- Distributed anonymous mobile robots: Formation of geometric patterns. SIAM Journal on Computing, 28(4):1347–1363, 1999. URL: https://doi.org/10.1137/S009753979628292X, arXiv:https://doi.org/10.1137/S009753979628292X.
- 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.