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

Jurek Czyzowicz, Leszek Gasieniec, Adrian Kosowski, Evangelos Kranakis, Danny Krizanc, Najmeh Taleb

Research output: Chapter in Book/Report/Conference proceedingConference contribution

12 Scopus citations

Abstract

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.

Original languageEnglish (US)
Title of host publicationAlgorithms and Computation - 26th International Symposium, ISAAC 2015, Proceedings
EditorsKhaled Elbassioni, Kazuhisa Makino
PublisherSpringer Verlag
Pages343-354
Number of pages12
ISBN (Print)9783662489703
DOIs
StatePublished - 2015
Event26th International Symposium on Algorithms and Computation, ISAAC 2015 - Nagoya, Japan
Duration: Dec 9 2015Dec 11 2015

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9472
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference26th International Symposium on Algorithms and Computation, ISAAC 2015
CountryJapan
CityNagoya
Period12/9/1512/11/15

Keywords

  • Fault tolerant
  • Idleness
  • Kotzig graphs
  • Patrolling

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'When patrolmen become corrupted: Monitoring a graph using faulty mobile robots'. Together they form a unique fingerprint.

  • Cite this

    Czyzowicz, J., Gasieniec, L., Kosowski, A., Kranakis, E., Krizanc, D., & Taleb, N. (2015). When patrolmen become corrupted: Monitoring a graph using faulty mobile robots. In K. Elbassioni, & K. Makino (Eds.), Algorithms and Computation - 26th International Symposium, ISAAC 2015, Proceedings (pp. 343-354). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9472). Springer Verlag. https://doi.org/10.1007/978-3-662-48971-0 _30