When patrolmen become corrupted: monitoring a graph using faulty mobile robots
From MaRDI portal
(Redirected from Publication:1679239)
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1950764 (Why is no real title available?)
- scientific article; zbMATH DE number 1420914 (Why is no real title available?)
- scientific article; zbMATH DE number 3276424 (Why is no real title available?)
- A distributed ant algorithm for efficiently patrolling a network
- Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds
- Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
- Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
- Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
- Fault-Tolerant and Self-stabilizing Mobile Robots Gathering
- Gathering despite mischief
- Multi-robot area patrol under frequency constraints
- On fence patrolling by mobile agents
- Patrolling games
- The NP-Completeness of Edge-Coloring
- The gathering problem for two oblivious robots with unreliable compasses
Cited in
(10)- When patrolmen become corrupted: monitoring a graph using faulty mobile robots
- A structured methodology for designing distributed algorithms for mobile entities
- Optimal strategies for patrolling fences
- 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
- Patrolling trees with mobile robots
- Patrolling on dynamic ring networks
- Perpetual maintenance of machines with different urgency requirements
- Continuous Patrolling Games
- Better upper bounds for searching on a line with 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 Q1679239)