Optimal exclusive perpetual grid exploration by luminous myopic opaque robots with common chirality
From MaRDI portal
Publication:6052703
DOI10.1016/j.tcs.2023.114162MaRDI QIDQ6052703
Pascal Lafourcade, Stéphane Devismes, Quentin Bramas
Publication date: 17 October 2023
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- Optimal probabilistic ring exploration by semi-synchronous oblivious robots
- Mutual visibility by luminous robots without collisions
- Circle formation of weak robots and Lyndon words
- Autonomous mobile robots with lights
- Remembering without memory: tree exploration by asynchronous oblivious robots
- Anonymous graph exploration without collision by mobile robots
- Stabilization, safety, and security of distributed systems. 20th international symposium, SSS 2018, Tokyo, Japan, November 4--7, 2018. Proceedings
- How many oblivious robots can explore a line
- Optimal torus exploration by oblivious robots
- Computing without communicating: ring exploration by asynchronous oblivious robots
- Leader Election Problem versus Pattern Formation Problem
- Exclusive Perpetual Ring Exploration without Chirality
- Gathering Despite Mischief
- Distributed Computing – IWDC 2005
- Ring exploration with myopic luminous robots
This page was built for publication: Optimal exclusive perpetual grid exploration by luminous myopic opaque robots with common chirality
