Unifying gathering protocols for swarms of mobile robots

DOI10.1007/978-3-031-30448-4_1MaRDI QIDQ6057307

Friedhelm Meyer auf der Heide, Jonas Harbig, Jannik Castenow

Publication date: 4 October 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

zbMATH Keywords

mobile robotsdiscretecontinuousgatheringruntime

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• A continuous strategy for collisionless gathering
• Impossibility of gathering by a set of autonomous mobile robots
• A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots
• Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
• Local Gathering of Mobile Robots in Three Dimensions
• Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
• The Minimum Covering Sphere Problem

This page was built for publication: Unifying gathering protocols for swarms of mobile robots