Constant-time complete visibility for asynchronous robots with lights
DOI10.1007/978-3-319-69084-1_18zbMATH Open1498.68036OpenAlexW2761993649MaRDI QIDQ5045448FDOQ5045448
Authors: Gokarna Sharma, Ramachandran Vaidyanathan, Jerry L. Trahan 
Publication date: 4 November 2022
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-69084-1_18
Recommendations
- Complete visibility for robots with lights in \(\mathrm{O}(1)\) time
- Fault-tolerant complete visibility for asynchronous robots with lights under one-axis agreement
- Fault-tolerant complete visibility for asynchronous robots with lights under one-axis agreement
- Optimum Algorithm for Mutual Visibility Among Asynchronous Robots with Lights
- Mutual visibility by luminous robots without collisions
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Artificial intelligence for robotics (68T40) Distributed systems (68M14)
Cited In (12)
- The mutual visibility problem for fat robots
- Optimum Algorithm for Mutual Visibility Among Asynchronous Robots with Lights
- Fault-tolerant complete visibility for asynchronous robots with lights under one-axis agreement
- Complete visibility for robots with lights in \(\mathrm{O}(1)\) time
- Explicit communication among stigmergic robots
- Asynchronous filling by myopic luminous robots
- Mutual visibility on grid by asynchronous luminous robots
- On fast pattern formation by autonomous robots
- Fault-tolerant complete visibility for asynchronous robots with lights under one-axis agreement
- Mutual visibility by asynchronous robots on infinite grid
- Rendezvous of Asynchronous Mobile Robots with Lights
- Mutual visibility by luminous robots without collisions
This page was built for publication: Constant-time complete visibility for asynchronous robots with lights
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5045448)
