Optimal \(\mathcal{L} \)-algorithms for rendezvous of asynchronous mobile robots with external-lights

DOI10.1016/j.tcs.2023.114198MaRDI QIDQ6057840

Takashi Okumura, Xavier Défago, Koichi Wada

Publication date: 26 October 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

rendezvousautonomous mobile robotslightsASYNCexternal lightsL-algorithms

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Self-stabilizing gathering with strong multiplicity detection
• Gathering of asynchronous robots with limited visibility
• Autonomous mobile robots with lights
• Rendezvous of two robots with visible bits
• 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
• 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: Optimal \(\mathcal{L} \)-algorithms for rendezvous of asynchronous mobile robots with external-lights