Fault-tolerant complete visibility for asynchronous robots with lights under one-axis agreement
From MaRDI portal
Publication:5919050
DOI10.1016/J.TCS.2020.10.033zbMath1464.68405OpenAlexW3097952269MaRDI QIDQ5919050
Pavan Poudel, Aisha Aljohani, Gokarna Sharma
Publication date: 16 December 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2020.10.033
Distributed systems (68M14) Artificial intelligence for robotics (68T40) Distributed algorithms (68W15)
Related Items (5)
Mutual visibility in graphs ⋮ Mutual visibility on grid by asynchronous luminous robots ⋮ Variety of mutual-visibility problems in graphs ⋮ Mutual-visibility sets in Cartesian products of paths and cycles ⋮ On the mutual visibility in Cartesian products and triangle-free graphs
Cites Work
- Mutual visibility by luminous robots without collisions
- Getting close without touching: near-gathering for autonomous mobile robots
- Autonomous mobile robots with lights
- Local spreading algorithms for autonomous robot systems
- Gathering few fat mobile robots in the plane
- Complete visibility for robots with lights in \(\mathrm{O}(1)\) time
- Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement
- Formation of General Position by Asynchronous Mobile Robots Under One-Axis Agreement
- A New Approach for Analyzing Convergence Algorithms for Mobile Robots
- Constant-Time Complete Visibility for Asynchronous Robots with Lights
- A distributed algorithm for gathering many fat mobile robots in the plane
- Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
- Distributed Computing – IWDC 2005
- Fault-tolerant complete visibility for asynchronous robots with lights under one-axis agreement
This page was built for publication: Fault-tolerant complete visibility for asynchronous robots with lights under one-axis agreement
