Local Gathering of Mobile Robots in Three Dimensions

DOI10.1007/978-3-030-54921-3_4OpenAlexW3046271098MaRDI QIDQ5100946

Jannik Castenow, Friedhelm Meyer auf der Heide, Michael Braun

Publication date: 1 September 2022

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2005.07495

zbMATH Keywords

mobile robotscontinuous timegatheringlocal strategies

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx) Communication complexity, information complexity (68Q11)

Related Items (2)

A discrete and continuous study of the \textsc{Max-Chain-Formation} problem ⋮ Unifying gathering protocols for swarms of mobile robots

Cites Work

• Plane formation by synchronous mobile robots without chirality
• A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots
• Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity
• Universally Optimal Gathering Under Limited Visibility
• Brief Announcement
• The Minimum Covering Sphere Problem
• The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots

This page was built for publication: Local Gathering of Mobile Robots in Three Dimensions