最优周界警戒的有效算法
Efficient Algorithms for Optimal Perimeter Guarding
摘要：
我们调查的问题，最佳分配大量的机器人（或其他类型的自主智能体），以保护封闭的2D区域的周边，其中每个区域的周边被保护可能包含多个不相交的多边形链。每个机器人负责守卫周边的一个子集，周边上的任何点都必须由某个机器人守卫。在分配机器人时，主要目标是最大限度地减少任何机器人沿区域边界所覆盖的最大一维距离。对于这个优化问题，我们称之为最佳周界防护（OPG），进行彻底的结构分析，然后利用它来开发快速精确的算法，运行在保证低多项式时间。除了形式化的分析和证明，实验评估和模拟进行，进一步验证了我们的算法结果的正确性和有效性。
英文摘要：
We investigate the problem of optimally assigning a large number of robots (or other types of autonomous agents) to guard the perimeters of closed 2D regions, where the perimeter of each region to be guarded may contain multiple disjoint polygonal chains. Each robot is responsible for guarding a subset of a perimeter and any point on a perimeter must be guarded by some robot. In allocating the robots, the main objective is to minimize the maximum 1D distance to be covered by any robot along the boundary of the regions. For this optimization problem which we call optimal perimeter guarding (OPG), thorough structural analysis is performed, which is then exploited to develop fast exact algorithms that run in guaranteed low polynomial time. In addition to formal analysis and proofs, experimental evaluations and simulations are performed that further validate the correctness and effectiveness of our algorithmic results.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
