Constant-time complete visibility for asynchronous robots with lights
From MaRDI portal
Publication:5045448
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
Cited in
(14)- Complete visibility for robots with lights in \(\mathrm{O}(1)\) time
- Asynchronous filling by myopic luminous robots
- On fast pattern formation by autonomous robots
- Mutual visibility on grid by asynchronous luminous robots
- Optimum Algorithm for Mutual Visibility Among Asynchronous Robots with Lights
- Mutual visibility by luminous robots without collisions
- Explicit communication among stigmergic robots
- 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
- Mutual visibility by asynchronous robots on infinite grid
- The mutual visibility problem for fat robots
- Rendezvous of Asynchronous Mobile Robots with Lights
- The mutual visibility problem for fat robots with lights
- The min-move mutual visibility problem for disoriented asynchronous robots
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)