arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2209.07557cs.CG
收藏

多机器人树的最优覆盖问题

On Optimal Coverage of a Tree with Multiple Robots

I. Aldana-Galván, J. C. Catana-Salazar, J. M. Díaz-Báñez, F. Duque, R. Fabila-Monroy, M. A. Heredia, A. Ramírez-Vigueras, J. Urrutia

摘要:

研究了$k$移动机器人最优覆盖树的算法问题。所有机器人都知道这棵树,我们的目标是为每个机器人分配一次行走,使这些行走的并集覆盖整棵树。我们假设这些边具有相同的长度,并且沿着一条边行进需要一个时间单位。考虑了两个目标函数:覆盖时间和覆盖长度。覆盖时间是机器人完成指定行走所需的最大时间,覆盖长度是所有行走长度的总和。我们还考虑了一个变种,其中的机器人必须定期会合在同一个顶点在最多一定数量的移动。我们表明,问题是不同的两个成本函数。对于覆盖时间最小化问题,我们证明了当$k$是输入的一部分时,该问题是NP-难的,无论是否需要周期性的会合。对于覆盖长度最小化问题,我们证明了当不需要周期交会时,它可以在多项式时间内求解,否则它是NP难的。

英文摘要:

We study the algorithmic problem of optimally covering a tree with $k$ mobile robots. The tree is known to all robots, and our goal is to assign a walk to each robot in such a way that the union of these walks covers the whole tree. We assume that the edges have the same length, and that traveling along an edge takes a unit of time. Two objective functions are considered: the cover time and the cover length. The cover time is the maximum time a robot needs to finish its assigned walk and the cover length is the sum of the lengths of all the walks. We also consider a variant in which the robots must rendezvous periodically at the same vertex in at most a certain number of moves. We show that the problem is different for the two cost functions. For the cover time minimization problem, we prove that the problem is NP-hard when $k$ is part of the input, regardless of whether periodic rendezvous are required or not. For the cover length minimization problem, we show that it can be solved in polynomial time when periodic rendezvous are not required, and it is NP-hard otherwise.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑