Priority evacuation from a disk: the case of \(n = 1,2,3\)
From MaRDI portal
Publication:2285157
DOI10.1016/j.tcs.2019.09.026zbMath1437.68173OpenAlexW2975694009MaRDI QIDQ2285157
Evangelos Kranakis, Jaroslav Opatrny, Ryan Killick, Lata Narayanan, Konstantinos Georgiou, Danny Krizanc, Jurek Czyzowicz, Sunil M. Shende
Publication date: 16 January 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2019.09.026
Related Items (6)
Evacuating from \(\ell_p\) unit disks in the wireless model (extended abstract) ⋮ Evacuating from \(\ell_p\) unit disks in the wireless model ⋮ Triangle evacuation of 2 agents in the wireless model (extended abstract) ⋮ Algorithms for \(p\)-Faulty Search on a half-line ⋮ Time-energy tradeoffs for evacuation by two robots in the wireless model ⋮ Weighted group search on a line \& implications to the priority evacuation problem
Cites Work
- Unnamed Item
- Searching in the plane
- Theory of optimal search
- Evacuating two robots from multiple unknown exits in a circle
- Priority evacuation from a disk using mobile robots (extended abstract)
- Evacuation from a disc in the presence of a faulty robot
- Parallel searching in the plane
- On the linear search problem
- Evacuating Robots from a Disk Using Face-to-Face Communication (Extended Abstract)
- Search Theory
- Collaboration Without Communication: Evacuating Two Robots from a Disk
- Evacuating Robots via Unknown Exit in a Disk
- Fast two-robot disk evacuation with wireless communication
This page was built for publication: Priority evacuation from a disk: the case of \(n = 1,2,3\)