Optimal rendezvous L-algorithms for asynchronous mobile robots with external-lights
From MaRDI portal
Publication:5091102
DOI10.4230/LIPICS.OPODIS.2018.24MaRDI QIDQ5091102FDOQ5091102
Authors: Takashi Okumura, Koichi Wada, Xavier Défago 
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1804.01368
Recommendations
- Optimal \(\mathcal{L} \)-algorithms for rendezvous of asynchronous mobile robots with external-lights
- Rendezvous of Asynchronous Mobile Robots with Lights
- Rendezvous of two robots with visible bits
- Asynchronous Gathering Algorithms for Autonomous Mobile Robots with Lights
- Rendezvous of two robots with constant memory
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)
Cites Work
- Distributed computing by mobile robots: gathering
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
- Gathering of asynchronous robots with limited visibility
- Impossibility of gathering by a set of autonomous mobile robots
- The Multi-Agent Rendezvous Problem. Part 1: The Synchronous Case
- Gathering Autonomous Mobile Robots with Dynamic Compasses: An Optimal Result
- Self-stabilizing gathering with strong multiplicity detection
- Rendezvous with constant memory
- The gathering problem for two oblivious robots with unreliable compasses
- Rendezvous of two robots with visible bits
- Autonomous mobile robots with lights
Cited In (3)
This page was built for publication: Optimal rendezvous \(\mathcal{L}\)-algorithms for asynchronous mobile robots with external-lights
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5091102)
