A continuous, local strategy for constructing a short chain of mobile robots
From MaRDI portal
Publication:3569124
Recommendations
- A discrete and continuous study of the \textsc{Max-Chain-Formation} problem
- Energy-efficient strategies for building short chains of mobile robots locally
- A Discrete and Continuous Study of the Max-Chain-Formation Problem
- Optimal strategies for maintaining a chain of relays between an explorer and a base camp
- Gathering a Euclidean closed chain of robots in linear time and improved algorithms for chain-formation
Cited in
(8)- Unifying gathering protocols for swarms of mobile robots
- A survey on relay placement with runtime and approximation guarantees
- Energy-efficient strategies for building short chains of mobile robots locally
- Optimal strategies for maintaining a chain of relays between an explorer and a base camp
- Gathering a Euclidean closed chain of robots in linear time
- Collisionless gathering of robots with an extent
- A Discrete and Continuous Study of the Max-Chain-Formation Problem
- Local Gathering of Mobile Robots in Three Dimensions
This page was built for publication: A continuous, local strategy for constructing a short chain of mobile robots
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3569124)