A Discrete and Continuous Study of the Max-Chain-Formation Problem

DOI10.1007/978-3-030-64348-5_6MaRDI QIDQ6487897zbMATH OpenFDO

Authors Jannik Castenow, Peter Kling, Till Knollmann, Friedhelm Meyer auf der Heide

Publication date 21 March 2023

Full work available at URL https://doi.org/10.1007/978-3-030-64348-5_6

Mathematics Subject Classification ID

Artificial intelligence for robotics (68T40) Distributed algorithms (68W15) Approximation algorithms (68W25) Analysis of algorithms (68W40)

Recommendations

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

Cited in

(6)

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

This page was built for publication: A Discrete and Continuous Study of the Max-Chain-Formation Problem

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