The following pages link to (Q4448363):
Displayed 11 items.
- Optimal probabilistic ring exploration by semi-synchronous oblivious robots (Q391193) (← links)
- Leader election and gathering for asynchronous fat robots without common chirality (Q491635) (← links)
- A unified approach for gathering and exclusive searching on rings under weak assumptions (Q518678) (← links)
- Uniform multi-agent deployment on a ring (Q627178) (← links)
- Of robot ants and elephants: a computational comparison (Q719319) (← links)
- Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformity (Q924138) (← links)
- Gathering few fat mobile robots in the plane (Q1004312) (← links)
- Distributed algorithms for partitioning a swarm of autonomous mobile robots (Q1008735) (← links)
- On time complexity for connectivity-preserving scattering of mobile robots (Q1643151) (← links)
- Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement (Q2634716) (← links)
- Optimum Gathering of Asynchronous Robots (Q2971632) (← links)