CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Optimal patrolling of fragmented boundaries

Andrew Collins ; Jurek Czyzowicz ; Leszek A. Ga̧sieniec ; Adrian Kosowski ; Evangelos Kranakis ; Danny Kriz̧anc ; Russel A. Martin ; Oscar Morales-Ponce (Institutionen för data- och informationsteknik, Nätverk och system (Chalmers) )
Annual ACM Symposium on Parallelism in Algorithms and Architectures p. 241-250. (2013)
[Konferensbidrag, refereegranskat]

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 uniform maximum speeds. 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].

Nyckelord: Algorithms, Boundary patrolling, Idleness, Mobile robots

Denna post skapades 2013-12-19.
CPL Pubid: 190070