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

DOI10.1007/s00453-016-0233-9zbMath1380.68367OpenAlexW2535803352MaRDI QIDQ1679239

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

Publication date: 9 November 2017

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-016-0233-9

zbMATH Keywords

mobile robotfault-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

Continuous Patrolling Games, A structured methodology for designing distributed algorithms for mobile entities, Perpetual maintenance of machines with different urgency requirements, Better Upper Bounds for Searching on a Line with Byzantine Robots, Unnamed Item, Optimal patrolling of high priority segments while visiting the unit interval with a set of mobile robots

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On fence patrolling by mobile agents
• Multi-robot area patrol under frequency constraints
• A distributed ant algorithm for efficiently patrolling a network
• Fence patrolling by mobile agents with distinct speeds
• Patrolling Games
• The Gathering Problem for Two Oblivious Robots with Unreliable Compasses
• Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds
• Fault-Tolerant and Self-stabilizing Mobile Robots Gathering
• Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
• The NP-Completeness of Edge-Coloring
• Gathering Despite Mischief
• Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
• Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots