Search on a Line by Byzantine Robots
DOI10.1142/s0129054121500209zbMath1522.68730OpenAlexW3119678299MaRDI QIDQ6114825
Evangelos Kranakis, Jurek Czyzowicz, Lata Narayanan, Sunil M. Shende, Konstantinos Georgiou, Jaroslav Opatrny, Danny Krizanc
Publication date: 15 August 2023
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054121500209
Analysis of algorithms and problem complexity (68Q25) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Artificial intelligence for robotics (68T40) Distributed algorithms (68W15)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Searching in the plane
- An annotated bibliography on guaranteed graph searching
- The theory of search games and rendezvous.
- Son of the linear search problem
- Online searching with turn cost
- On the linear search problem
- More on the linear search problem
- Yet more on the linear search problem
- The return of the linear search problem
- The Polygon Exploration Problem
- A General Framework for Searching on a Line
- Linear Search by a Pair of Distinct-Speed Robots
- Revisiting the Problem of Searching on a Line
- Distributed computation in dynamic networks
- When Patrolmen Become Corrupted: Monitoring a Graph Using Faulty Mobile Robots
- How to learn an unknown environment. I
- The Byzantine Generals Problem
- Exploring Unknown Environments
- Gathering Despite Mischief
- Group Search on the Line
- Lower Bounds for Searching Robots, some Faulty
- Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
- Search on a Line with Faulty Robots
- Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
- Exploring unknown environments with obstacles
This page was built for publication: Search on a Line by Byzantine Robots
