The mutual visibility problem for fat robots

DOI10.1007/978-3-031-38906-1_2arXiv2206.14423OpenAlexW4385357894MaRDI QIDQ6138984

André van Renssen, Joachim Gudmundsson, Rusul J. Alsaedi

Publication date: 16 January 2024

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

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

zbMATH Keywords

collision avoidancerobots with lightsfat robotsobstructed visibilitymutual visibility

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Data structures (68P05)

Cites Work

• Leader election and gathering for asynchronous fat robots without common chirality
• Mutual visibility by luminous robots without collisions
• Autonomous mobile robots with lights
• Local spreading algorithms for autonomous robot systems
• Gathering few fat mobile robots in the plane
• Complete visibility for robots with lights in \(\mathrm{O}(1)\) time
• Collisionless Gathering of Robots with an Extent
• Distributed Computing by Mobile Robots: Gathering
• Constant-Time Complete Visibility for Asynchronous Robots with Lights
• A distributed algorithm for gathering many fat mobile robots in the plane
• Distributed Computing – IWDC 2005

This page was built for publication: The mutual visibility problem for fat robots