Patrolling a path connecting a set of points with unbalanced frequencies of visits

Huda Chuangpishit, Jurek Czyzowicz, Leszek Gąsieniec, Konstantinos Georgiou, Tomasz Jurdziński, Evangelos Kranakis

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

4 Scopus citations

Abstract

Patrolling consists of scheduling perpetual movements of a collection of mobile robots, so that each point of the environment is regularly revisited by any robot in the collection. In previous research, it was assumed that all points of the environment needed to be revisited with the same minimal frequency. In this paper we study efficient patrolling protocols for points located on a path, where each point may have a different constraint on frequency of visits. The problem of visiting such divergent points was recently posed by Gąsieniec et al. in [14], where the authors study protocols using a single robot patrolling a set of n points located in nodes of a complete graph and in Euclidean spaces. The focus in this paper is on patrolling with two robots. We adopt a scenario in which all points to be patrolled are located on a line. We provide several approximation algorithms concluding with the best currently known 3 -approximation.

Original languageEnglish (US)
Title of host publicationSOFSEM 2018
Subtitle of host publicationTheory and Practice of Computer Science - 44th International Conference on Current Trends in Theory and Practice of Computer Science, Proceedings
EditorsJirí Wiedermann, A Min Tjoa, Stefan Biffl, Ladjel Bellatreche, Jan van Leeuwen
PublisherSpringer Verlag
Pages367-380
Number of pages14
ISBN (Print)9783319731162
DOIs
StatePublished - Jan 1 2018
Externally publishedYes
Event44th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2018 - Krems, Austria
Duration: Jan 29 2018Feb 2 2018

Publication series

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

Conference

Conference44th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2018
CountryAustria
CityKrems,
Period1/29/182/2/18

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Chuangpishit, H., Czyzowicz, J., Gąsieniec, L., Georgiou, K., Jurdziński, T., & Kranakis, E. (2018). Patrolling a path connecting a set of points with unbalanced frequencies of visits. In J. Wiedermann, A. M. Tjoa, S. Biffl, L. Bellatreche, & J. van Leeuwen (Eds.), SOFSEM 2018: Theory and Practice of Computer Science - 44th International Conference on Current Trends in Theory and Practice of Computer Science, Proceedings (pp. 367-380). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10706 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-73117-9_26