Optimum Algorithm for Mutual Visibility Among Asynchronous Robots with Lights
From MaRDI portal
Publication:5045451
Recommendations
- Mutual visibility on grid by asynchronous luminous robots
- Optimal rendezvous \(\mathcal{L}\)-algorithms for asynchronous mobile robots with external-lights
- Optimal \(\mathcal{L} \)-algorithms for rendezvous of asynchronous mobile robots with external-lights
- Constant-time complete visibility for asynchronous robots with lights
- Mutual visibility for asynchronous robots
- Asynchronous Gathering Algorithms for Autonomous Mobile Robots with Lights
- Rendezvous of Asynchronous Mobile Robots with Lights
- 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
Cited in
(6)- Constant-time complete visibility for asynchronous robots with lights
- Mutual visibility on grid by asynchronous luminous robots
- Mutual visibility by asynchronous robots on infinite grid
- Optimal \(\mathcal{L} \)-algorithms for rendezvous of asynchronous mobile robots with external-lights
- Rendezvous of Asynchronous Mobile Robots with Lights
- Mutual visibility by luminous robots without collisions
This page was built for publication: Optimum Algorithm for Mutual Visibility Among Asynchronous Robots with Lights
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5045451)