Gathering a Euclidean closed chain of robots in linear time
From MaRDI portal
Publication:2148881
DOI10.1007/978-3-030-89240-1_3OpenAlexW3210546132MaRDI QIDQ2148881
Jonas Harbig, Friedhelm Meyer auf der Heide, Till Knollmann, Daniel Jung, Jannik Castenow
Publication date: 24 June 2022
Full work available at URL: https://arxiv.org/abs/2010.04424
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed systems (68M14) Artificial intelligence for robotics (68T40)
Related Items (2)
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
Cites Work
- Unnamed Item
- 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
- On time complexity for connectivity-preserving scattering of mobile robots
- Gathering anonymous, oblivious robots on a grid
- A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots
- Complexity of network synchronization
- Universally Optimal Gathering Under Limited Visibility
This page was built for publication: Gathering a Euclidean closed chain of robots in linear time
