The following pages link to (Q5501371):
Displaying 13 items.
- Energy-efficient strategies for building short chains of mobile robots locally (Q392202) (← links)
- A survey on relay placement with runtime and approximation guarantees (Q465673) (← links)
- Gathering of asynchronous robots with limited visibility (Q557818) (← links)
- Optimal strategies for maintaining a chain of relays between an explorer and a base camp (Q838151) (← links)
- Self-deployment of mobile sensors on a ring (Q936531) (← links)
- Optimal Byzantine-resilient convergence in uni-dimensional robot networks (Q986551) (← links)
- Gathering few fat mobile robots in the plane (Q1004312) (← links)
- Distributed algorithms for partitioning a swarm of autonomous mobile robots (Q1008735) (← links)
- Rendezvous in planar environments with obstacles and unknown initial distance (Q2321296) (← links)
- Impossibility of gathering by a set of autonomous mobile robots (Q2382675) (← links)
- A New Approach for Analyzing Convergence Algorithms for Mobile Robots (Q3012964) (← links)
- Collisionless Gathering of Robots with an Extent (Q3075515) (← links)
- Gathering over Meeting Nodes in Infinite Grid* (Q5044391) (← links)
