Rendezvous of Asynchronous Mobile Robots with Lights

DOI10.1007/978-3-319-98355-4_25zbMath1514.68016arXiv1707.04449OpenAlexW2885334437MaRDI QIDQ6163643

Koichi Wada, Takashi Okumura, Yoshiaki Katayama

Publication date: 30 June 2023

Published in: Adventures Between Lower Bounds and Higher Altitudes (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Distributed systems (68M14) Artificial intelligence for robotics (68T40)

Cites Work

• Self-stabilizing gathering with strong multiplicity detection
• Gathering of asynchronous robots with limited visibility
• Autonomous mobile robots with lights
• Impossibility of gathering by a set of autonomous mobile robots
• The Gathering Problem for Two Oblivious Robots with Unreliable Compasses
• Distributed Computing by Mobile Robots: Gathering
• Gathering Autonomous Mobile Robots with Dynamic Compasses: An Optimal Result
• The Multi-Agent Rendezvous Problem. Part 1: The Synchronous Case
• Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
• Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
• Rendezvous with constant memory

This page was built for publication: Rendezvous of Asynchronous Mobile Robots with Lights