COLLINS, Andrew; CZYZOWICZ, Jurek; GASIENIEC, Leszek; KOSOWSKI, Adrian; KRANAKIS, Evangelos; KRIZANC, Danny; MARTIN, Russell; MORALES PONCE, Oscar

doi:10.1145/2486159.2486176

Métadonnées

Afficher la notice complète

Licence d’utilisation du document

COLLINS, Andrew
Department of Computer Science [Liverpool]

CZYZOWICZ, Jurek
Département d'Informatique et d'Ingénierie [DII]

GASIENIEC, Leszek
Department of Computer Science [Liverpool]

Langue

Communication dans un congrès

Ce document a été publié dans

SPAA - 25th Symposium on Parallelism in Algorithms and Architectures, 2013, Montreal. 2013p. 241-250

ACM

Résumé en anglais

A set of mobile robots is deployed on a simple curve of finite length, composed of a finite set of vital segments separated by neutral segments. The robots have to patrol the vital segments by perpetually moving on the curve, without exceeding their maximum speed. The quality of patrolling is measured by the idleness, i.e., the longest time period during which any vital point on the curve is not visited by any robot. Given a configuration of vital segments, our goal is to provide algorithms describing the movement of the robots along the curve so as to minimize the idleness. Our main contribution is a proof that the optimal solution to the patrolling problem is attained either by the cyclic strategy, in which all the robots move in one direction around the curve, or by the partition strategy, in which the curve is partitioned into sections which are patrolled separately by individual robots. These two fundamental types of strategies were studied in the past in the robotics community in different theoretical and experimental settings. However, to our knowledge, this is the first theoretical analysis proving optimality in such a general scenario. Throughout the paper we assume that all robots have the same maximum speed. In fact, the claim is known to be invalid when this assumption does not hold, cf. [Czyzowicz et al., Proc. ESA 2011].< Réduire

Mots clés en anglais

mobile agents

idleness

boundary patrolling

cycle

Métadonnées

Partager cette publication !

Licence d’utilisation du document

Optimal Patrolling of Fragmented Boundaries

Langue

Ce document a été publié dans

Résumé en anglais

Mots clés en anglais

URI

DOI

Origine

Unités de recherche