Search on a Line with Faulty Robots

DOI10.1145/2933057.2933102zbMath1375.68187OpenAlexW2477849570MaRDI QIDQ5361963

Jaroslav Opatrny, Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Lata Narayanan

Publication date: 29 September 2017

Published in: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2933057.2933102

zbMATH Keywords

faulty robotscow-path problemsearch on a linecompetitive ratio.

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (15)

Linear Search with Terrain-Dependent Speeds ⋮ Bike assisted evacuation on a line ⋮ Rendezvous on a Line by Location-Aware Robots Despite the Presence of Byzantine Faults ⋮ Querying with Uncertainty ⋮ Optimal rendezvous on a line by location-aware robots in the presence of spies* ⋮ Search on a Line by Byzantine Robots ⋮ Better Upper Bounds for Searching on a Line with Byzantine Robots ⋮ Lower bounds for searching robots, some faulty ⋮ Linear search by a pair of distinct-speed robots ⋮ Gathering in the plane of location-aware robots in the presence of spies ⋮ Wireless evacuation on \(m\) rays with \(k\) searchers ⋮ Time-energy tradeoffs for evacuation by two robots in the wireless model ⋮ Linear rendezvous with asymmetric clocks ⋮ Energy Consumption of Group Search on a Line ⋮ Group search of the plane with faulty robots

This page was built for publication: Search on a Line with Faulty Robots