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

Peyman Afshani, Mark de Berg, Kevin Buchin, Jie Gao, Maarten Löffler, Amir Nayyeri, Benjamin Raichel, Rik Sarkar, Haotian Wang, Hao Tsung Yang

研究成果: 書貢獻/報告類型篇章同行評審

1 引文 斯高帕斯(Scopus)


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(k2logwmaxwmin) to the optimal solution, where wmax and wmin 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 time (nwmax/wmin)O(k).

主出版物標題Springer Proceedings in Advanced Robotics
發行者Springer Science and Business Media B.V.
出版狀態已出版 - 2021


名字Springer Proceedings in Advanced Robotics


深入研究「Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max Latency」主題。共同形成了獨特的指紋。