Algorithms for \(p\)-Faulty Search on a half-line
From MaRDI portal
Publication:6174824
DOI10.1007/s00453-022-01075-yMaRDI QIDQ6174824
Anthony Bonato, Konstantinos Georgiou, Paweł Prałat, Calum MacRury
Publication date: 17 August 2023
Published in: Algorithmica (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem
- Searching in the plane
- On the two-dimensional cow search problem
- Search games
- Theory of optimal search
- The theory of search games and rendezvous.
- A general framework for searching on a line
- The expanding search ratio of a graph
- Weighted group search on a line (extended abstract)
- Priority evacuation from a disk: the case of \(n \geq 4\)
- Priority evacuation from a disk: the case of \(n = 1,2,3\)
- Online searching with turn cost
- Searching on a line: a complete characterization of the optimal solution
- On the linear search problem
- Collaborative search on the plane without communication
- Ten Open Problems in Rendezvous Search
- Undirected ST-connectivity in log-space
- Exploring an Infinite Space with Finite Memory Scouts
- Exploring Unknown Environments
- A tight lower bound for semi-synchronous collaborative grid exploration
- Energy Consumption of Group Search on a Line
- Parallel Bayesian Search with No Coordination
- Search and Foraging
- Collaboration Without Communication: Evacuating Two Robots from a Disk
- Linear Search with Terrain-Dependent Speeds
- Evacuating Robots via Unknown Exit in a Disk
- Fast two-robot disk evacuation with wireless communication
- Wireless evacuation on \(m\) rays with \(k\) searchers
- Time-energy tradeoffs for evacuation by two robots in the wireless model
- Optimal circle search despite the presence of faulty robots
This page was built for publication: Algorithms for \(p\)-Faulty Search on a half-line
