Patrolling trees with mobile robots
From MaRDI portal
Publication:1631946
DOI10.1007/978-3-319-51966-1_22zbMATH Open1403.68296OpenAlexW2566811934MaRDI QIDQ1631946FDOQ1631946
Authors: Jurek Czyzowicz, Adrian Kosowski, Evangelos Kranakis, Najmeh Taleb 
Publication date: 7 December 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-51966-1_22
Recommendations
- Distributed patrolling with two-speed robots (and an application to transportation)
- When patrolmen become corrupted: monitoring a graph using faulty mobile robots
- Patrolling by robots equipped with visibility
- When patrolmen become corrupted: monitoring a graph using faulty mobile robots
- On optimal coverage of a tree with multiple robots
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Artificial intelligence for robotics (68T40)
Cited In (11)
- Patrolling by robots equipped with visibility
- When patrolmen become corrupted: monitoring a graph using faulty mobile robots
- Optimal strategies for patrolling fences
- Collaborative exploration of trees by energy-constrained mobile robots
- On the robustness of a synchronized multi-robot system
- Distributed patrolling with two-speed robots (and an application to transportation)
- Approximation algorithms for multi-robot patrol-scheduling with min-max latency
- Optimal patrolling of high priority segments while visiting the unit interval with a set of mobile robots
- On optimal coverage of a tree with multiple robots
- When patrolmen become corrupted: monitoring a graph using faulty mobile robots
- Two Robots Patrolling on a Line: Integer Version and Approximability
This page was built for publication: Patrolling trees with mobile robots
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1631946)
