Assume that n wireless sensors are initially arbitrarily distributed on a line segment barrier. Each sensor is said to cover the portion of the barrier that intersects with its sensing area. Owing to incorrect initial position, or the death of some of the sensors, the barrier is not completely covered by the sensors. We employ a mobile robot to move the sensors to final positions on the barrier such that barrier coverage is guaranteed. We seek algorithms that minimize the length of the robot's trajectory, since this allows the restoration of barrier coverage as soon as possible. We give an optimal linear-time offline algorithm that gives a minimum-length trajectory for a robot that starts at one end of the barrier and achieves the restoration of barrier coverage. We also study two different online models: one in which the online robot does not know the length of the barrier in advance, and the other in which the online robot knows the length of the barrier. For the case when the online robot does not know the length of the barrier, we prove a tight bound of 3∕2 on the competitive ratio, and we give a tight lower bound of 5∕4 on the competitive ratio in the other case.

, , , , ,
Discrete Applied Mathematics
School of Computer Science

Czyzowicz, J. (J.), Kranakis, E, Krizanc, D. (D.), Narayanan, L. (L.), & Opatrny, J. (J.). (2020). Optimal online and offline algorithms for robot-assisted restoration of barrier coverage. Discrete Applied Mathematics, 285, 650–662. doi:10.1016/j.dam.2020.04.027