Circle formation by asynchronous opaque fat robots on an infinite grid

References

• Agmon N, Peleg D. Fault-tolerant gathering algorithms for autonomous mobile robots. SIAM J Comput. 2006;36(1):56–82. doi: 10.1137/050645221
   Web of Science ®Google Scholar
• Cicerone S, Stefano GD, Navarra A. Gathering of robots on meeting-points: feasibility and optimal resolution algorithms. Distrib Comput. 2018;31(1):1–50. doi: 10.1007/s00446-017-0293-3
   Web of Science ®Google Scholar
• Goswami P, Sharma A, Ghosh S, et al. Time optimal gathering of myopic robots on an infinite triangular grid. In: Devismes S, Petit F, Altisen K, et al., editors. Stabilization, Safety, and security of distributed systems – 24th International Symposium, SSS 2022, Clermont-Ferrand, France, November 15–17, 2022, Proceedings; (Lecture Notes in Computer Science; Vol. 13751). Springer; 2022. p. 270–284. doi: 10.1007/978-3-031-21017-4_18
   Google Scholar
• Bramas Q, Lamani A, Tixeuil S. Stand up indulgent gathering. Theor Comput Sci. 2023;939:63–77. doi: 10.1016/j.tcs.2022.10.015
   Web of Science ®Google Scholar
• Molla AR, Jr WKM. Dispersion of mobile robots. In: ICDCN '22: 23rd International Conference on Distributed Computing and Networking, Delhi, AA, India, January 4 – 7, 2022. ACM; 2022. p. 217–220. doi: 10.1145/3491003.3493373
   Google Scholar
• Kaur T, Mondal K. Distance-2-dispersion: dispersion with further constraints. In: Mohaisen D, Wies T, editors. Networked Systems – 11th International Conference, NETYS 2023, Benguerir, Morocco, May 22-24, 2023, Proceedings; (Lecture Notes in Computer Science; Vol. 14067). Springer; 2023. p. 157–173. doi: 10.1007/978-3-031-37765-5_12
   Google Scholar
• Bramas Q, Devismes S, Lafourcade P. Infinite grid exploration by disoriented robots. In: Georgiou C, Majumdar R, editors. Networked Systems – 8th International Conference, NETYS 2020, Marrakech, Morocco, June 3-5, 2020, Proceedings; (Lecture Notes in Computer Science; Vol. 12129). Springer; 2020. p. 129–145. doi: 10.1007/978-3-030-67087-0_9
   Google Scholar
• Darwich O, Ulucan A, Bramas Q, et al. Perpetual torus exploration by myopic luminous robots. In: Devismes S, Petit F, Altisen K, et al., editors. Stabilization, Safety, and Security of Distributed Systems – 24th International Symposium, SSS 2022, Clermont-Ferrand, France, November 15-17, 2022, Proceedings; (Lecture Notes in Computer Science; Vol. 13751). Springer; 2022. p. 164–177. doi: 10.1007/978-3-031-21017-4_11
   Google Scholar
• Czyzowicz J, Dobrev S, Killick R, et al. Graph exploration by energy-sharing mobile agents. In: Jurdzinski T, Schmid S, editors. Structural information and communication complexity – 28th International Colloquium, SIROCCO 2021, Wrocław, Poland, June 28 – July 1, 2021, Proceedings; (Lecture Notes in Computer Science; Vol. 12810). Springer; 2021. p. 185–203. doi: 10.1007/978-3-030-79527-6_11
   Google Scholar
• Flocchini P, Prencipe G, Santoro N, et al. Arbitrary pattern formation by asynchronous, anonymous, oblivious robots. Theor Comput Sci. 2008;407(1-3):412–447. doi: 10.10.1016/j.tcs.2008.07.026
   Web of Science ®Google Scholar
• Ghosh S, Goswami P, Sharma A, et al. Move optimal and time optimal arbitrary pattern formations by asynchronous robots on infinite grid. Int J Parallel Emergent Distrib Syst. 2023;38(1):35–57. doi: 10.1080/17445760.2022.2124411
   Web of Science ®Google Scholar
• Flocchini P, Prencipe G, Santoro N, et al. Gathering of asynchronous robots with limited visibility. Theor Comput Sci. 2005;337(1-3):147–168. doi: 10.1016/j.tcs.2005.01.001
   Web of Science ®Google Scholar
• Luna GAD, Uehara R, Viglietta G, et al. Gathering on a circle with limited visibility by anonymous oblivious robots. In: Attiya H, editor. 34th International symposium on distributed computing, DISC 2020, October 12-16, 2020, Virtual Conference; (LIPIcs; Vol. 179). Schloss Dagstuhl – Leibniz-Zentrum für Informatik; 2020. p. 12:1–12:17. doi: 10.4230/LIPIcs.DISC.2020.12
   Google Scholar
• Adhikary R, Kundu MK, Sau B. Circle formation by asynchronous opaque robots on infinite grid. Comput Sci. 2021 Feb;22(1):81–100. doi: 10.7494/csci.2021.22.1.3840. https://journals.agh.edu.pl/csci/article/view/3840.
   Google Scholar
• Feletti C, Mereghetti C, Palano B. Uniform circle formation for fully, semi-, and asynchronous opaque robots with lights. Appl Sci. 2023;13(13):7991. Available at https://www.mdpi.com/2076-3417/13/13/7991.
   Google Scholar
• Feletti C, Mereghetti C, Palano B. Uniform circle formation for swarms of opaque robots with lights: 20th international symposium, sss 2018, tokyo, japan, november 4–7, 2018, proceedings; 2018. p. 317–332.
   Google Scholar
• Tanaka O. Forming a circle by distributed anonymous mobile robots. Hiroshima : Department of Electrical Engineering, Hiroshima University; 1992. Bachelor thesis.
   Google Scholar
• Kundu MK, Goswami P, Ghosh S, et al. Arbitrary pattern formation by opaque fat robots on infinite grid. Int J Parallel Emergent Distrib Syst. 2022;37(5):542–570. doi: 10.1080/17445760.2022.2088750
   Web of Science ®Google Scholar
• Bose K, Adhikary R, Kundu MK, et al. Arbitrary pattern formation by opaque fat robots with lights. In: Changat M, Das S, editors. Algorithms and discrete applied mathematics – 6th International Conference, CALDAM 2020, Hyderabad, India, February 13-15, 2020, Proceedings; (Lecture Notes in Computer Science; Vol. 12016). Springer; 2020. p. 347–359. doi: 10.1007/978-3-030-39219-2_28
   Google Scholar
• Dutta A, Gan Chaudhuri S, Datta S, et al. Circle formation by asynchronous fat robots with limited visibility. 02; 2012. p. 83–93.
   Google Scholar
• Sugihara K, Suzuki I. Distributed motion coordination of multiple mobile robots. Proc 5th IEEE Int Symp Intell Control. 1990;1:138–143. Available at https://api.semanticscholar.org/CorpusID:61599595.
   Google Scholar
• Défago X, Souissi S. Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformity. Theor Comput Sci. 2008;396(1-3):97–112. doi: 10.1016/j.tcs.2008.01.050
   Web of Science ®Google Scholar
• Suzuki I, Yamashita M. Distributed anonymous mobile robots: formation of geometric patterns. SIAM J Comput. 1999;28(4):1347–1363. doi: 10.1137/S009753979628292X
   Web of Science ®Google Scholar
• Défago X, Konagaya A. Circle formation for oblivious anonymous mobile robots with no common sense of orientation. In: Proceedings of the second ACM international workshop on principles of mobile computing; New York, NY, USA. Association for Computing Machinery; 2002. p. 97–104; POMC '02. doi: 10.1145/584490.584509
   Google Scholar
• Flocchini P, Prencipe G, Santoro N, et al. Distributed computing by mobile robots: uniform circle formation. Distrib Comput. 2017;30(6):413–457. doi: 10.1007/s00446-016-0291-x
   Web of Science ®Google Scholar
• Ito Y, Kim Y, Katayama Y. Brief announcement: mutually-visible uniform circle formation by asynchronous mobile robots on grid plane. In: International symposium on stabilizing, safety, and security of distributed systems; Springer; 2022. p. 352–357.
   Google Scholar