Searching for a Non-adversarial, Uncooperative Agent on a Cycle
From MaRDI portal
Publication:5056057
DOI10.1007/978-3-319-72751-6_9zbMath1503.68023MaRDI QIDQ5056057
Jurek Czyzowicz, Maxime Godon, Stefan Dobrev, Jorge Urrutia, Toshinori Sakai, Evangelos Kranakis
Publication date: 9 December 2022
Published in: Algorithms for Sensor Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-72751-6_9
68Q25: Analysis of algorithms and problem complexity
68M14: Distributed systems
68T40: Artificial intelligence for robotics
Cites Work
- Gathering of asynchronous robots with limited visibility
- Searching in the plane
- The theory of search games and rendezvous.
- Gathering asynchronous oblivious mobile robots in a ring
- On the linear search problem
- Evacuating Robots from a Disk Using Face-to-Face Communication (Extended Abstract)
- Different Speeds Suffice for Rendezvous of Two Agents on Arbitrary Graphs
- Collaboration Without Communication: Evacuating Two Robots from a Disk
- Evacuating Robots via Unknown Exit in a Disk
- Unnamed Item
- Unnamed Item