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

DOI10.1016/J.TCS.2008.04.010zbMATH Open1191.68714OpenAlexW2040689398MaRDI QIDQ838151FDOQ838151

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

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

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

zbMATH Keywords

distributed systemsmobile robotsnetwork communication

Mathematics Subject Classification ID

Artificial intelligence for robotics (68T40)

Cites Work

• Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
• Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
• Title not available (Why is that?)
• Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
• Title not available (Why is that?)
• Structural Information and Communication Complexity
• Title not available (Why is that?)
• Dynamic Compass Models and Gathering Algorithms for Autonomous Mobile Robots
• Online searching with an autonomous robot

Cited In (11)

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

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)