Subhajit Pramanick
Partha Sarathi Mandal
ABSTRACT
In this paper, we study the line formation problem using n oblivious point mobile robots located on distinct positions on the Euclidean plane. We assume that the robots agree on one coordinate axis. Robots operate in Look-Compute-Move (LCM) cycles and any two robots can see each other only if there is no robot present on the line segment joining them. Our aim is to solve the line formation problem even if some robots become faulty before achieving the goal. The robots cannot move anymore once they become faulty. We present a fault-tolerant distributed algorithm for line formation under y-axis agreement which runs in O(n) epochs in semi-synchronous setting. The same algorithm runs in D/ymin epochs in asynchronous setting, where D is the vertical distance between the farthest robots along the y-axis and ymin is the minimum non-zero vertical distance traveled by a robot in each LCM cycle.
- Subhash Bhagat and Krishnendu Mukhopadyaya. 2017. Fault-tolerant gathering of semi-synchronous robots. In Proceedings of the 18th International Conference on Distributed Computing and Networking. 1–10.Google Scholar
Digital Library
- Quentin Bramas and Sébastien Tixeuil. 2016. Brief Announcement: Probabilistic asynchronous arbitrary pattern formation. In Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing. 443–445.Google ScholarDigital Library
- Sruti Gan Chaudhuri, Swapnil Ghike, Shrainik Jain, and Krishnendu Mukhopadhyaya. 2014. Pattern Formation for Asynchronous Robots without Agreement in Chirality. CoRR abs/1403.2625(2014). arXiv:1403.2625http://arxiv.org/abs/1403.2625Google Scholar
- Shantanu Das, Paola Flocchini, Nicola Santoro, and Masafumi Yamashita. 2015. Forming sequences of geometric patterns with oblivious mobile robots. Distributed Computing 28, 2 (2015), 131–145.Google ScholarDigital Library
- Xavier Défago and Samia Souissi. 2008. Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformity. Theoretical Computer Science 396, 1-3 (2008), 97–112.Google ScholarDigital Library
- Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, and Giovanni Viglietta. 2017. Distributed computing by mobile robots: uniform circle formation. Distributed Computing 30, 6 (2017), 413–457.Google ScholarDigital Library
- Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, and Peter Widmayer. 2008. Arbitrary pattern formation by asynchronous, anonymous, oblivious robots. Theoretical Computer Science 407, 1-3 (2008), 412–447.Google ScholarDigital Library
- Debasish Pattanayak, Klaus-Tycho Foerster, Partha Sarathi Mandal, and Stefan Schmid. 2020. Conic Formation in Presence of Faulty Robots. In Algorithms for Sensor Systems, Cristina M. Pinotti, Alfredo Navarra, and Amitabha Bagchi (Eds.). Springer International Publishing, Cham, 170–185.Google Scholar
- Debasish Pattanayak, Kaushik Mondal, H Ramesh, and Partha Sarathi Mandal. 2019. Gathering of mobile robots with weak multiplicity detection in presence of crash-faults. J. Parallel and Distrib. Comput. 123 (2019), 145–155.Google ScholarCross Ref
- Giuseppe Prencipe. 2007. Impossibility of gathering by a set of autonomous mobile robots. Theoretical Computer Science 384, 2-3 (2007), 222–231.Google ScholarDigital Library
- Yusaku Tomita, Yukiko Yamauchi, Shuji Kijima, and Masafumi Yamashita. 2017. Plane formation by synchronous mobile robots without chirality. arXiv preprint arXiv:1705.06521(2017).Google Scholar
- Yukiko Yamauchi, Taichi Uehara, Shuji Kijima, and Masafumi Yamashita. 2017. Plane formation by synchronous mobile robots in the three-dimensional euclidean space. Journal of the ACM (JACM) 64, 3 (2017), 1–43.Google ScholarDigital Library
- Yukiko Yamauchi and Masafumi Yamashita. 2013. Pattern formation by mobile robots with limited visibility. In International Colloquium on Structural Information and Communication Complexity. Springer, 201–212.Google Scholar
Index Terms
- Asynchronous Line Formation in Presence of Faulty Robots
Recommendations
Conic Formation in Presence of Faulty Robots
Algorithms for Sensor SystemsAbstractPattern formation is one of the most fundamental problems in distributed computing, which has recently received much attention. In this paper, we initiate the study of distributed pattern formation in situations when some robots can be faulty. In ...
Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
From an engineering point of view, the problem of coordinating a set of autonomous, mobile robots for the purpose of cooperatively performing a task has been studied extensively over the past decade. In contrast, in this paper we aim to understand the ...
Flocking along line by autonomous oblivious mobile robots
ICDCN '19: Proceedings of the 20th International Conference on Distributed Computing and NetworkingSwarm robot is a collection of tiny identical autonomous mobile robots who collaboratively perform a given task. One of the main objectives of swarm robots is to place themselves on a geographic region forming a particular geometric pattern in order to ...
Comments