Optimal rendezvous L-algorithms for asynchronous mobile robots with external-lights

DOI10.4230/LIPICS.OPODIS.2018.24MaRDI QIDQ5091102zbMATH OpenFDO

Authors Takashi Okumura, Koichi Wada, Xavier Défago

Publication date 21 July 2022

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

zbMATH Keywords

rendezvousautonomous mobile robotslights\(\mathcal{L}\)-algorithms

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)

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

Cites work

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

Cited in

(3)

• Optimum Algorithm for Mutual Visibility Among Asynchronous Robots with Lights
• Optimal \(\mathcal{L} \)-algorithms for rendezvous of asynchronous mobile robots with external-lights
• Rendezvous of Asynchronous Mobile Robots with Lights

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)