Universally optimal gathering under limited visibility
From MaRDI portal
Publication:5045450
Recommendations
Cited in
(15)- On time complexity for connectivity-preserving scattering of mobile robots
- Complete visibility for robots with lights in \(\mathrm{O}(1)\) time
- Gathering a Euclidean closed chain of robots in linear time and improved algorithms for chain-formation
- On fast pattern formation by autonomous robots
- Gathering a Euclidean closed chain of robots in linear time
- A discrete and continuous study of the \textsc{Max-Chain-Formation} problem
- Local Gathering of Mobile Robots in Three Dimensions
- Gathering of asynchronous robots with limited visibility
- Time optimal gathering of myopic robots on an infinite triangular grid
- The Max-Line-Formation Problem
- Gathering on a circle with limited visibility by anonymous oblivious robots
- Time optimal gathering of myopic robots on an infinite triangular grid
- Gathering on a circle with limited visibility by anonymous oblivious robots
- Asynchronous gathering of finite memory robots on a circle under limited visibility
- Getting close without touching: near-gathering for autonomous mobile robots
This page was built for publication: Universally optimal gathering under limited visibility
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5045450)