Collision-Free Linear Time Mutual Visibility for Asynchronous Fat Robots
Open Access
- 4 January 2024
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 84-93
Abstract
This paper studies the mutual visibility problem for a distributed system of n ≥ 3 asynchronous opaque fat robots under the obstructed visibility model. Robots are represented as unit discs in the Euclidean plane and they block both motions and visions of the other robots through them. The mutual visibility problem requires the robots to reposition themselves in such a way that all the robots in the system become mutually visible to each other. Collision-free movement is one of the desirable features that any algorithm for fat robots needs to satisfy. This paper proposes a distributed collision-free mutual visibility algorithm for asynchronous fat robots with externally visible lights. The proposed algorithm uses O(1) colors for the lights of the robots, assumes one-axis agreement, and runs in O(n) asynchronous rounds.Keywords
This publication has 12 references indexed in Scilit:
- Optimal Randomized Complete Visibility on a Grid for Asynchronous Robots with LightsInternational Journal of Networking and Computing, 2021
- Fault-tolerant complete visibility for asynchronous robots with lights under one-axis agreementTheoretical Computer Science, 2021
- Sublinear-time mutual visibility for fat oblivious robots2019
- Distributed Computing by Mobile Entities2019
- How to Make Fat Autonomous Robots See all Others Fast?2018
- Complete Visibility for Mobile Robots with Lights Tolerating FaultsInternational Journal of Networking and Computing, 2018
- Optimum Algorithm for Mutual Visibility Among Asynchronous Robots with Lights2017
- Constant-Time Complete Visibility for Asynchronous Robots with Lights2017
- Formation of General Position by Asynchronous Mobile Robots Under One-Axis Agreement2016
- Mutual Visibility with an Optimal Number of Colors2015