Gathering problems for autonomous mobile robots with lights
From MaRDI portal
Publication:2680865
DOI10.1016/j.tcs.2022.11.018OpenAlexW4309624616MaRDI QIDQ2680865
Satoshi Terai, Yoshiaki Katayama, Koichi Wada
Publication date: 4 January 2023
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1811.12068
Cites Work
- Self-stabilizing gathering with strong multiplicity detection
- Gathering of asynchronous robots with limited visibility
- Synchronous robots vs asynchronous lights-enhanced robots on graphs
- Autonomous mobile robots with lights
- Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane
- Rendezvous of two robots with visible bits
- Self-stabilizing gathering of mobile robots under crash or Byzantine faults
- 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
- LATIN 2004: Theoretical Informatics
- Synchronous gathering without multiplicity detection: a certified algorithm
- Rendezvous with constant memory
This page was built for publication: Gathering problems for autonomous mobile robots with lights
