When patrolmen become corrupted: monitoring a graph using faulty mobile robots

DOI10.1007/978-3-662-48971-0_30MaRDI QIDQ3459874zbMATH OpenOpenAlexFDO

Authors Jurek Czyzowicz, Adrian Kosowski, Najmeh Taleb, Leszek Gąsieniec, Evangelos Kranakis, D. Krizanc

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-tolerantidlenessKotzig graphspatrolling

Mathematics Subject Classification ID

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

Recommendations

• When patrolmen become corrupted: monitoring a graph using faulty mobile robots
• Patrolling trees with mobile robots
• Patrolling on dynamic ring networks
• Simple Strategies Versus Optimal Schedules in Multi-agent Patrolling
• Patrolling by robots equipped with visibility

Cited in

(11)

• Patrolling trees with mobile robots
• When patrolmen become corrupted: monitoring a graph using faulty mobile robots
• A distributed ant algorithm for efficiently patrolling a network
• Search on a line with faulty robots
• Patrolling on dynamic ring networks
• Group search of the plane with faulty robots
• Bamboo garden trimming problem (perpetual maintenance of machines with different attendance urgency factors)
• 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*
• Gathering in the plane of location-aware robots in the presence of spies
• Search on a Line by Byzantine Robots

This page was built for publication: When patrolmen become corrupted: monitoring a graph using faulty mobile robots

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