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

DOI10.1007/S00453-016-0233-9zbMATH Open1380.68367OpenAlexW2535803352MaRDI QIDQ1679239FDOQ1679239

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

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

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

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)

Cites Work

• Title not available (Why is that?)
• 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
• A distributed ant algorithm for efficiently patrolling a network
• Patrolling games
• Title not available (Why is that?)
• On fence patrolling by mobile agents
• Fault-Tolerant and Self-stabilizing Mobile Robots Gathering
• Title not available (Why is that?)
• Multi-robot area patrol under frequency constraints
• Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds
• The gathering problem for two oblivious robots with unreliable compasses
• Fence patrolling by mobile agents with distinct speeds
• Title not available (Why is that?)

Cited In (7)

• Title not available (Why is that?)
• Better Upper Bounds for Searching on a Line with Byzantine Robots
• A structured methodology for designing distributed algorithms for mobile entities
• Optimal patrolling of high priority segments while visiting the unit interval with a set of mobile robots
• A distributed ant algorithm for efficiently patrolling a network
• Perpetual maintenance of machines with different urgency requirements
• Continuous Patrolling Games

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 Q1679239)