A continuous, local strategy for constructing a short chain of mobile robots
DOI10.1007/978-3-642-13284-1_14zbMATH Open1284.68561OpenAlexW1588762506MaRDI QIDQ3569124FDOQ3569124
Authors: Bastian Degener, Barbara Kempkes, Peter Kling, Friedhelm Meyer auf der Heide 
Publication date: 17 June 2010
Published in: Structural Information and Communication Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-13284-1_14
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
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Artificial intelligence for robotics (68T40)
Cited In (8)
- Energy-efficient strategies for building short chains of mobile robots locally
- Gathering a Euclidean closed chain of robots in linear time
- Local Gathering of Mobile Robots in Three Dimensions
- Optimal strategies for maintaining a chain of relays between an explorer and a base camp
- A survey on relay placement with runtime and approximation guarantees
- Unifying gathering protocols for swarms of mobile robots
- Collisionless gathering of robots with an extent
- A Discrete and Continuous Study of the Max-Chain-Formation Problem
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)
