Search on a line with faulty robots

DOI10.1145/2933057.2933102MaRDI QIDQ5361963zbMATH OpenOpenAlexFDO

Authors Jurek Czyzowicz, Jaroslav Opatrny, Evangelos Kranakis, D. 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

competitive ratio.cow-path problemfaulty robotssearch on a line

Mathematics Subject Classification ID

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

Recommendations

• Search on a line with faulty robots
• Search on a Line by Byzantine Robots
• Search on a line by Byzantine robots
• Lower bounds for searching robots, some faulty
• Lower bounds for searching robots, some faulty

Cited in

(28)

• Linear search by a pair of distinct-speed robots
• Parallel searching in the plane
• Lower bounds for searching robots, some faulty
• Search on a line with faulty robots
• Probabilistically faulty searching on a half-line (extended abstract)
• Group search of the plane with faulty robots
• Linear search by a pair of distinct-speed robots
• Better upper bounds for searching on a line with Byzantine robots
• Search on a line by Byzantine robots
• 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*
• Linear rendezvous with asymmetric clocks
• Energy consumption of group search on a line
• Lower bounds for searching robots, some faulty
• Linear Search with Terrain-Dependent Speeds
• Finding defectives on a line by random docking and interval group tests
• Lower bounds for shoreline searching with 2 or more robots
• Gathering in the plane of location-aware robots in the presence of spies
• Wireless evacuation on \(m\) rays with \(k\) searchers
• Search on a Line by Byzantine Robots
• Evacuation of equilateral triangles by mobile agents of limited communication range
• Chauffeuring a crashed robot from a disk
• Optimal circle search despite the presence of faulty robots
• Capturing a moving target by two robots in the F2F model
• Linear search with probabilistic detection and variable speeds
• Bike assisted evacuation on a line
• Fault-tolerant sequential scan

This page was built for publication: Search on a line with faulty robots

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5361963)