Energy-efficient strategies for building short chains of mobile robots locally

DOI10.1016/j.tcs.2012.10.056zbMath1358.68290OpenAlexW2025085543MaRDI QIDQ392202

Philipp Brandes, Barbara Kempkes, Bastian Degener, Friedhelm Meyer auf der Heide

Publication date: 13 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.10.056

zbMATH Keywords

dynamicsdistributed algorithmsmobile robotsconvergence speedlocal algorithmsgeometric networksrobot formation problems

Mathematics Subject Classification ID

Artificial intelligence for robotics (68T40) Distributed algorithms (68W15)

Related Items (4)

A discrete and continuous study of the \textsc{Max-Chain-Formation} problem ⋮ A survey on relay placement with runtime and approximation guarantees ⋮ Computing on rings by oblivious robots: a unified approach for different tasks ⋮ Gathering a Euclidean closed chain of robots in linear time and improved algorithms for chain-formation

Cites Work

• Unnamed Item
• Optimal strategies for maintaining a chain of relays between an explorer and a base camp
• Impossibility of gathering by a set of autonomous mobile robots
• Gathering Autonomous Mobile Robots with Dynamic Compasses: An Optimal Result
• A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots
• Structural Information and Communication Complexity
• Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems

This page was built for publication: Energy-efficient strategies for building short chains of mobile robots locally