skip to main content
10.1145/3569551.3569553acmotherconferencesArticle/Chapter ViewAbstractPublication PagesnsyssConference Proceedingsconference-collections
research-article

Asynchronous Line Formation in Presence of Faulty Robots

Published: 20 December 2022 Publication History

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.

References

[1]
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.
[2]
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.
[3]
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.2625
[4]
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.
[5]
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.
[6]
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.
[7]
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.
[8]
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.
[9]
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.
[10]
Giuseppe Prencipe. 2007. Impossibility of gathering by a set of autonomous mobile robots. Theoretical Computer Science 384, 2-3 (2007), 222–231.
[11]
Yusaku Tomita, Yukiko Yamauchi, Shuji Kijima, and Masafumi Yamashita. 2017. Plane formation by synchronous mobile robots without chirality. arXiv preprint arXiv:1705.06521(2017).
[12]
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.
[13]
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.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences
NSysS '22: Proceedings of the 9th International Conference on Networking, Systems and Security
December 2022
113 pages
ISBN:9781450399036
DOI:10.1145/3569551
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 20 December 2022

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Distributed Algorithms
  2. Fault Tolerance
  3. Line Formation
  4. Oblivious Mobile Robots
  5. Pattern Formation
  6. Robot Networks

Qualifiers

  • Research-article
  • Research
  • Refereed limited

Funding Sources

  • Science and Engineering Research Board (SERB), DST, Govt. of India

Conference

9th NSysS 2022

Acceptance Rates

Overall Acceptance Rate 12 of 44 submissions, 27%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 29
    Total Downloads
  • Downloads (Last 12 months)5
  • Downloads (Last 6 weeks)0
Reflects downloads up to 05 Mar 2025

Other Metrics

Citations

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

HTML Format

View this article in HTML Format.

HTML Format

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media