On Cyclic Solutions to the Min-Max Latency Multi-Robot Patrolling Problem

by   Peyman Afshani, et al.

We consider the following surveillance problem: Given a set P of n sites in a metric space and a set of k robots with the same maximum speed, compute a patrol schedule of minimum latency for the robots. Here a patrol schedule specifies for each robot an infinite sequence of sites to visit (in the given order) and the latency L of a schedule is the maximum latency of any site, where the latency of a site s is the supremum of the lengths of the time intervals between consecutive visits to s. When k=1 the problem is equivalent to the travelling salesman problem (TSP) and thus it is NP-hard. We have two main results. We consider cyclic solutions in which the set of sites must be partitioned into ℓ groups, for some ℓ≤ k, and each group is assigned a subset of the robots that move along the travelling salesman tour of the group at equal distance from each other. Our first main result is that approximating the optimal latency of the class of cyclic solutions can be reduced to approximating the optimal travelling salesman tour on some input, with only a 1+ε factor loss in the approximation factor and an O(( k/ε)^k) factor loss in the runtime, for any ε >0. Our second main result shows that an optimal cyclic solution is a 2(1-1/k)-approximation of the overall optimal solution. Note that for k=2 this implies that an optimal cyclic solution is optimal overall. The results have a number of consequences. For the Euclidean version of the problem, for instance, combining our results with known results on Euclidean TSP, yields a PTAS for approximating an optimal cyclic solution, and it yields a (2(1-1/k)+ε)-approximation of the optimal unrestricted solution. If the conjecture mentioned above is true, then our algorithm is actually a PTAS for the general problem in the Euclidean setting.


page 3

page 7

page 9

page 13

page 15

page 17

page 19

page 21


Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max Latency

We consider the problem of finding patrol schedules for k robots to visi...

Matchings under distance constraints II

This paper introduces the d-distance b-matching problem, in which we are...

Multi-Robot Persistent Monitoring: Minimizing Latency and Number of Robots with Recharging Constraints

In this paper we study multi-robot path planning for persistent monitori...

Fault Tolerance in Euclidean Committee Selection

In the committee selection problem, the goal is to choose a subset of si...

Interruptible Algorithms for Multiproblem Solving

In this paper we address the problem of designing an interruptible syste...

Euclidean 3D Stable Roommates is NP-hard

We establish NP-completeness for the Euclidean 3D Stable Roommates probl...

Please sign up or login with your details

Forgot password? Click here to reset