Gathering a Euclidean closed chain of robots in linear time and improved algorithms for chain-formation

DOI10.1016/J.TCS.2022.10.031zbMath1499.68351OpenAlexW4307723340MaRDI QIDQ2098190

Jannik Castenow, Till Knollmann, Friedhelm Meyer auf der Heide, Daniel Jung, Jonas Harbig

Publication date: 17 November 2022

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

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

zbMATH Keywords

gatheringruntimelimited visibilitydisoriented

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed systems (68M14) Artificial intelligence for robotics (68T40)

Cites Work

• Energy-efficient strategies for building short chains of mobile robots locally
• Optimal strategies for maintaining a chain of relays between an explorer and a base camp
• Autonomous mobile robots with lights
• Local spreading algorithms for autonomous robot systems
• Lost in self-stabilization: a local process that aligns connected cells
• Gathering a Euclidean closed chain of robots in linear time
• Gathering anonymous, oblivious robots on a grid
• Complexity of network synchronization
• Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
• Universally Optimal Gathering Under Limited Visibility
• The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots
• A Discrete and Continuous Study of the Max-Chain-Formation Problem
• The Max-Line-Formation Problem

This page was built for publication: Gathering a Euclidean closed chain of robots in linear time and improved algorithms for chain-formation