TY - GEN
T1 - When patrolmen become corrupted
T2 - 26th International Symposium on Algorithms and Computation, ISAAC 2015
AU - Czyzowicz, Jurek
AU - Gasieniec, Leszek
AU - Kosowski, Adrian
AU - Kranakis, Evangelos
AU - Krizanc, Danny
AU - Taleb, Najmeh
N1 - Funding Information:
This work was partially supported by NSERC grants. Research on this problem was initiated at the MITACS “International Problem Solving Workshop” held on July 16-20, 2012, in Vancouver, BC, Canada. The authors would like to express their deepest appreciation for the generous support of MITACS.
Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2015.
PY - 2015
Y1 - 2015
N2 - A team of k mobile robots is deployed on a weighted graph whose edge weights represent distances. The robots perpetually move along the domain, represented by all points belonging to the graph edges, not exceeding their maximal speed. The robots need to patrol the graph by regularly visiting all points of the domain. In this paper, we consider a team of robots (patrolmen), at most f of which may be unreliable, i.e. they fail to comply with their patrolling duties. What algorithm should be followed so as to minimize the maximum time between successive visits of every edge point by a reliable patrolmen? The corresponding measure of efficiency of patrolling called idleness has been widely accepted in the robotics literature. We extend it to the case of untrusted patrolmen; we denote by Áf k(G) the maximum time that a point of the domain may remain unvisited by reliable patrolmen. The objective is to find patrolling strategies minimizing Áf/k(G). We investigate this problem for various classes of graphs. We design optimal algorithms for line segments, which turn out to be surprisingly different from strategies for related patrolling problems proposed in the literature. We then use these results to study the case of general graphs. For Eulerian graphs G, we give an optimal patrolling strategy with idleness Áf/k(G) = (f + 1)|E|/k, where |E| is the sum of the lengths of the edges of G. Further, we show the hardness of the problem of computing the idle time for three robots, at most one of which is faulty, by reduction from 3-edge-coloring of cubic graphs — a known NP-hard problem. A byproduct oclass is known in the literature under the name of Kotzig graphs.
AB - A team of k mobile robots is deployed on a weighted graph whose edge weights represent distances. The robots perpetually move along the domain, represented by all points belonging to the graph edges, not exceeding their maximal speed. The robots need to patrol the graph by regularly visiting all points of the domain. In this paper, we consider a team of robots (patrolmen), at most f of which may be unreliable, i.e. they fail to comply with their patrolling duties. What algorithm should be followed so as to minimize the maximum time between successive visits of every edge point by a reliable patrolmen? The corresponding measure of efficiency of patrolling called idleness has been widely accepted in the robotics literature. We extend it to the case of untrusted patrolmen; we denote by Áf k(G) the maximum time that a point of the domain may remain unvisited by reliable patrolmen. The objective is to find patrolling strategies minimizing Áf/k(G). We investigate this problem for various classes of graphs. We design optimal algorithms for line segments, which turn out to be surprisingly different from strategies for related patrolling problems proposed in the literature. We then use these results to study the case of general graphs. For Eulerian graphs G, we give an optimal patrolling strategy with idleness Áf/k(G) = (f + 1)|E|/k, where |E| is the sum of the lengths of the edges of G. Further, we show the hardness of the problem of computing the idle time for three robots, at most one of which is faulty, by reduction from 3-edge-coloring of cubic graphs — a known NP-hard problem. A byproduct oclass is known in the literature under the name of Kotzig graphs.
KW - Fault tolerant
KW - Idleness
KW - Kotzig graphs
KW - Patrolling
UR - http://www.scopus.com/inward/record.url?scp=84951943974&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84951943974&partnerID=8YFLogxK
U2 - 10.1007/978-3-662-48971-0 _30
DO - 10.1007/978-3-662-48971-0 _30
M3 - Conference contribution
AN - SCOPUS:84951943974
SN - 9783662489703
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 343
EP - 354
BT - Algorithms and Computation - 26th International Symposium, ISAAC 2015, Proceedings
A2 - Elbassioni, Khaled
A2 - Makino, Kazuhisa
PB - Springer Verlag
Y2 - 9 December 2015 through 11 December 2015
ER -