When Patrolmen Become Corrupted: Monitoring a Graph Using Faulty Mobile Robots

DOI10.1007/978-3-662-48971-0_30zbMath1380.68366OpenAlexW2395192821MaRDI QIDQ3459874

Jurek Czyzowicz, Najmeh Taleb, Adrian Kosowski, Danny Krizanc, Leszek Gąsieniec, Evangelos Kranakis

Publication date: 11 January 2016

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-48971-0_30

zbMATH Keywords

fault-tolerantpatrollingidlenessKotzig graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Artificial intelligence for robotics (68T40)

Related Items (7)

Rendezvous on a Line by Location-Aware Robots Despite the Presence of Byzantine Faults ⋮ Optimal rendezvous on a line by location-aware robots in the presence of spies* ⋮ Search on a Line by Byzantine Robots ⋮ Bamboo Garden Trimming Problem (Perpetual Maintenance of Machines with Different Attendance Urgency Factors) ⋮ Search on a line with faulty robots ⋮ Gathering in the plane of location-aware robots in the presence of spies ⋮ Group search of the plane with faulty robots

This page was built for publication: When Patrolmen Become Corrupted: Monitoring a Graph Using Faulty Mobile Robots