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

DOI10.1016/J.TCS.2012.10.056zbMATH Open1358.68290OpenAlexW2025085543MaRDI QIDQ392202FDOQ392202

Authors Philipp Brandes, Bastian Degener, Barbara Kempkes, 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 robotslocal algorithmsconvergence speedgeometric networksrobot formation problems

Mathematics Subject Classification ID

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

Recommendations

• A continuous, local strategy for constructing a short chain of mobile robots
• Optimal strategies for maintaining a chain of relays between an explorer and a base camp
• A discrete and continuous study of the \textsc{Max-Chain-Formation} problem
• Gathering a Euclidean closed chain of robots in linear time and improved algorithms for chain-formation
• A Discrete and Continuous Study of the Max-Chain-Formation Problem

Cites work

• A continuous, local strategy for constructing a short chain of mobile robots
• Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
• Fault-tolerant gathering algorithms for autonomous mobile robots
• Gathering Autonomous Mobile Robots with Dynamic Compasses: An Optimal Result
• Impossibility of gathering by a set of autonomous mobile robots
• Optimal strategies for maintaining a chain of relays between an explorer and a base camp
• Structural Information and Communication Complexity

Cited in

(6)

• A survey on relay placement with runtime and approximation guarantees
• Computing on rings by oblivious robots: a unified approach for different tasks
• A continuous, local strategy for constructing a short chain of mobile robots
• Optimal strategies for maintaining a chain of relays between an explorer and a base camp
• A discrete and continuous study of the \textsc{Max-Chain-Formation} problem
• Gathering a Euclidean closed chain of robots in linear time and improved algorithms for chain-formation

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q392202)