Optimal strategies for maintaining a chain of relays between an explorer and a base camp

DOI10.1016/j.tcs.2008.04.010zbMath1191.68714OpenAlexW2040689398MaRDI QIDQ838151

Jarosław Kutyłowski, Friedhelm Meyer auf der Heide

Publication date: 21 August 2009

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

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

zbMATH Keywords

distributed systemsmobile robotsnetwork communication

Mathematics Subject Classification ID

Artificial intelligence for robotics (68T40)

Related Items

Gathering Anonymous, Oblivious Robots on a Grid ⋮ Lost in self-stabilization: a local process that aligns connected cells ⋮ Gathering a Euclidean closed chain of robots in linear time ⋮ A discrete and continuous study of the \textsc{Max-Chain-Formation} problem ⋮ Energy-efficient strategies for building short chains of mobile robots locally ⋮ A survey on relay placement with runtime and approximation guarantees ⋮ Collisionless Gathering of Robots with an Extent ⋮ Gathering anonymous, oblivious robots on a grid ⋮ Gathering a Euclidean closed chain of robots in linear time and improved algorithms for chain-formation

Cites Work

• Online searching with an autonomous robot
• Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
• Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
• Structural Information and Communication Complexity
• Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
• Dynamic Compass Models and Gathering Algorithms for Autonomous Mobile Robots
• Unnamed Item
• Unnamed Item
• Unnamed Item