Optimal patrolling of fragmented boundaries
Andrew Collins, Jurek Czyzowicz, Leszek Antoni Gąsieniec, Adrian Kosowski, Evangelos Kranakis, Danny Kriz̧anc, Russell Martin, Oscar Morales Ponce · 2013
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.