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

05/05/2020
by   Peyman Afshani, et al.
5

We consider the problem of finding patrol schedules for k robots to visit a given set of n sites in a metric space. Each robot has the same maximum speed and the goal is to minimize the weighted maximum latency of any site, where the latency of a site is defined as the maximum time duration between consecutive visits of that site. The problem is NP-hard, as it has the traveling salesman problem as a special case (when k=1 and all sites have the same weight). We present a polynomial-time algorithm with an approximation factor of O(k^2 logw_max/w_min) to the optimal solution, where w_max and w_min are the maximum and minimum weight of the sites respectively. Further, we consider the special case where the sites are in 1D. When all sites have the same weight, we present a polynomial-time algorithm to solve the problem exactly. If the sites may have different weights, we present a 12-approximate solution, which runs in polynomial time when the number of robots, k, is a constant.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/14/2022

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

We consider the following surveillance problem: Given a set P of n sites...
research
02/12/2023

The Two-Squirrel Problem and Its Relatives

In this paper, we start with a variation of the star cover problem calle...
research
03/15/2023

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...
research
09/12/2021

Maximum-Profit Routing Problem with Multiple Vehicles per Site

We consider the Maximum-Profit Routing Problem (MPRP), a variant of pick...
research
09/12/2019

Optimal Routing Schedules for Robots Operating in Aisle-Structures

In this paper, we consider the Constant-cost Orienteering Problem (COP) ...
research
07/06/2020

Online Learning of Facility Locations

In this paper, we provide a rigorous theoretical investigation of an onl...
research
08/02/2018

A Class of Weighted TSPs with Applications

Motivated by applications to poaching and burglary prevention, we define...

Please sign up or login with your details

Forgot password? Click here to reset