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

DOI10.1016/J.TCS.2008.04.010MaRDI QIDQ838151zbMATH OpenOpenAlexFDO

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

Publication date 21 August 2009

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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)

Recommendations

• A continuous, local strategy for constructing a short chain of mobile robots
• Energy-efficient strategies for building short chains of mobile robots locally
• A Discrete and Continuous Study of the Max-Chain-Formation Problem
• A survey on relay placement with runtime and approximation guarantees
• A discrete and continuous study of the \textsc{Max-Chain-Formation} problem

Cites work

• scientific article; zbMATH DE number 1629980 (Why is no real title available?)
• scientific article; zbMATH DE number 2038783 (Why is no real title available?)
• Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
• Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
• Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
• Dynamic Compass Models and Gathering Algorithms for Autonomous Mobile Robots
• Fault-tolerant gathering algorithms for autonomous mobile robots
• Online searching with an autonomous robot
• Structural Information and Communication Complexity

Cited in

(12)

• A survey on relay placement with runtime and approximation guarantees
• Energy-efficient strategies for building short chains of mobile robots locally
• A continuous, local strategy for constructing a short chain of mobile robots
• Gathering a Euclidean closed chain of robots in linear time
• The Max-Line-Formation Problem
• Gathering anonymous, oblivious robots on a grid
• Collisionless gathering of robots with an extent
• Gathering Anonymous, Oblivious Robots on a Grid
• A Discrete and Continuous Study of the Max-Chain-Formation Problem
• 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
• Lost in self-stabilization: a local process that aligns connected cells

This page was built for publication: Optimal strategies for maintaining a chain of relays between an explorer and a base camp

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