多机器人持续监控:最小化充电约束下的延迟和机器人数量
Multi-Robot Persistent Monitoring: Minimizing Latency and Number of Robots with Recharging Constraints
摘要:
在本文中,我们研究了多机器人路径规划的持续监测任务。我们考虑的情况下,机器人有一个有限的电池容量与放电时间$D$。我们将被监控的区域表示为加权图的顶点。对于每个顶点,机器人访问之间的最大允许时间有一个约束,称为延迟。我们的目标是找到最少数量的机器人,可以满足这些延迟的限制,同时也确保机器人定期在充电站充电。这个问题的决策版本是已知的PSPACE完全。我们提出了一个$O(\frac{\log D}{\log \log D}\log ρ)$近似算法的问题,其中$ρ$是最大和最小延迟约束的比率。我们还提出了一个定向运动为基础的启发式来解决这个问题,经验表明,它通常提供更高质量的解决方案比近似算法。我们扩展我们的研究结果提供了一个算法的问题,最大加权延迟给定一个固定数量的机器人。我们评估我们的算法在巡逻的情况下,在野火监测应用程序的大型问题实例。我们还比较了算法与现有的求解器的基准实例。
英文摘要:
In this paper we study multi-robot path planning for persistent monitoring tasks. We consider the case where robots have a limited battery capacity with a discharge time $D$. We represent the areas to be monitored as the vertices of a weighted graph. For each vertex, there is a constraint on the maximum allowable time between robot visits, called the latency. The objective is to find the minimum number of robots that can satisfy these latency constraints while also ensuring that the robots periodically charge at a recharging depot. The decision version of this problem is known to be PSPACE-complete. We present a $O(\frac{\log D}{\log \log D}\log ρ)$ approximation algorithm for the problem where $ρ$ is the ratio of the maximum and the minimum latency constraints. We also present an orienteering based heuristic to solve the problem and show empirically that it typically provides higher quality solutions than the approximation algorithm. We extend our results to provide an algorithm for the problem of minimizing the maximum weighted latency given a fixed number of robots. We evaluate our algorithms on large problem instances in a patrolling scenario and in a wildfire monitoring application. We also compare the algorithms with an existing solver on benchmark instances.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。