The Max-Line-Formation Problem

DOI10.1007/978-3-030-91081-5_19MaRDI QIDQ6488442zbMATH OpenFDO

Authors Jannik Castenow, Thorsten Götte, Till Knollmann, Friedhelm Meyer auf der Heide

Publication date 21 April 2023

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

Mathematics Subject Classification ID

Artificial intelligence for robotics (68T40) Distributed systems (68M14)

Recommendations

• 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 Discrete and Continuous Study of the Max-Chain-Formation Problem
• Gathering a Euclidean closed chain of robots in linear time
• Universally optimal gathering under limited visibility

Cites work

• A Discrete and Continuous Study of the Max-Chain-Formation Problem
• Gathering a Euclidean closed chain of robots in linear time
• Gathering anonymous, oblivious robots on a grid
• Local spreading algorithms for autonomous robot systems
• On Distributed Averaging Algorithms and Quantization Effects
• Optimal strategies for maintaining a chain of relays between an explorer and a base camp
• Universally optimal gathering under limited visibility

Cited in

(5)

• 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
• A simple algorithm for r-gatherings on the line
• A discrete and continuous study of the \textsc{Max-Chain-Formation} problem
• A Discrete and Continuous Study of the Max-Chain-Formation Problem

This page was built for publication: The Max-Line-Formation Problem

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