Satakshi Ghosh
ABSTRACT
The “Arbitrary Pattern Formation” and the “Gathering” are two fundamental problems in distributed systems. The Arbitrary Pattern Formation (Apf) problem asks to design a distributed algorithm following which the robots autonomously can form any arbitrary but specific pattern, which is provided to the robots as an input colliding with another robot. The gathering problem requires robots that are initially positioned arbitrarily must meet at a single point within finite time. Note that the meeting point is not fixed initially. These problems stand at the core of research within this field, with numerous existing solutions, each built upon varying assumptions. However, the primary objective of this work is to tackle these distributed problems while making minimal assumptions.
- Subhash Bhagat, Paola Flocchini, Krishnendu Mukhopadhyaya, and Nicola Santoro. 2020. Weak robots performing conflicting tasks without knowing who is in their team. In ICDCN 2020: 21st International Conference on Distributed Computing and Networking, Kolkata, India, January 4-7, 2020, Nandini Mukherjee and Sriram V. Pemmaraju (Eds.). ACM, 29:1–29:6. https://doi.org/10.1145/3369740.3369794Google Scholar
Digital Library
- Kaustav Bose, Ranendu Adhikary, Manash Kumar Kundu, and Buddhadeb Sau. 2020. Arbitrary pattern formation on infinite grid by asynchronous oblivious robots. Theor. Comput. Sci. 815 (2020), 213–227. https://doi.org/10.1016/j.tcs.2020.02.016Google ScholarDigital Library
- Satakshi Ghosh, Pritam Goswami, Avisek Sharma, and Buddhadeb Sau. 2023. Move optimal and time optimal arbitrary pattern formations by asynchronous robots on infinite grid. Int. J. Parallel Emergent Distributed Syst. 38, 1 (2023), 35–57. https://doi.org/10.1080/17445760.2022.2124411Google ScholarCross Ref
- Satakshi Ghosh, Avisek Sharma, Pritam Goswami, and Buddhadeb Sau. 2023. Brief Announcement: Asynchronous Gathering of Finite Memory Robots on a Circle Under Limited Visibility. In Stabilization, Safety, and Security of Distributed Systems - 25th International Symposium, SSS 2023, Jersey City, NJ, USA, October 2-4, 2023, Proceedings(Lecture Notes in Computer Science, Vol. 14310), Shlomi Dolev and Baruch Schieber (Eds.). Springer, 430–434. https://doi.org/10.1007/978-3-031-44274-2_32Google ScholarDigital Library
- Satakshi Ghosh, Avisek Sharma, Pritam Goswami, and Buddhadeb Sau. 2023. Oblivious Robots Performing Different Tasks on Grid Without Knowing Their Team Members. In 9th International Conference on Automation, Robotics and Applications, ICARA 2023, Abu Dhabi, United Arab Emirates, February 10-12, 2023. IEEE, 180–186. https://doi.org/10.1109/ICARA56516.2023.10125816Google ScholarCross Ref
- Giuseppe Antonio Di Luna, Ryuhei Uehara, Giovanni Viglietta, and Yukiko Yamauchi. 2020. Gathering on a Circle with Limited Visibility by Anonymous Oblivious Robots. In 34th International Symposium on Distributed Computing, DISC 2020, October 12-16, 2020, Virtual Conference(LIPIcs, Vol. 179), Hagit Attiya (Ed.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 12:1–12:17. https://doi.org/10.4230/LIPIcs.DISC.2020.12Google ScholarCross Ref
Index Terms
- Gathering and Arbitrary Pattern Formation by Asynchronous Robot Swarm
Recommendations
Arbitrary Pattern Formation on Infinite Grid by Asynchronous Oblivious Robots
WALCOM: Algorithms and ComputationAbstractThe Arbitrary Pattern Formation problem asks to design a distributed algorithm that allows a set of autonomous mobile robots to form any specific but arbitrary geometric pattern given as input. The problem has been extensively studied in ...
Arbitrary pattern formation on infinite grid by asynchronous oblivious robots
AbstractThe Arbitrary Pattern Formation problem asks to design a distributed algorithm that allows a set of autonomous mobile robots to form any specific but arbitrary geometric pattern given as input. The problem has been extensively studied ...
Arbitrary Pattern Formation by Asynchronous Opaque Robots with Lights
Structural Information and Communication ComplexityAbstractThe Arbitrary Pattern Formation problem asks for a distributed algorithm that moves a set of autonomous mobile robots to form any arbitrary pattern given as input. The robots are assumed to be autonomous, anonymous and identical. They operate in ...
Comments