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

faulty robotscow-path problemsearch on a linecompetitive ratio.

Mathematics Subject Classification ID

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

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

(25)

• Energy consumption of group search on a line
• Bike assisted evacuation on a line
• Group search of the plane with faulty robots
• Linear rendezvous with asymmetric clocks
• Fault-tolerant sequential scan
• Finding defectives on a line by random docking and interval group tests
• Gathering in the plane of location-aware robots in the presence of spies
• Search on a line with faulty robots
• Search on a line by Byzantine robots
• Linear search by a pair of distinct-speed robots
• Parallel searching in the plane
• Rendezvous on a Line by Location-Aware Robots Despite the Presence of Byzantine Faults
• Lower bounds for shoreline searching with 2 or more robots
• Linear Search with Terrain-Dependent Speeds
• Linear search by a pair of distinct-speed robots
• Querying with Uncertainty
• Optimal rendezvous on a line by location-aware robots in the presence of spies*
• Optimal circle search despite the presence of faulty robots
• Wireless evacuation on \(m\) rays with \(k\) searchers
• Search on a Line by Byzantine Robots
• Chauffeuring a crashed robot from a disk
• Evacuation of equilateral triangles by mobile agents of limited communication range
• Better upper bounds for searching on a line with Byzantine robots
• Lower bounds for searching robots, some faulty
• Lower bounds for searching robots, some faulty

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)