具有异质防御者的有效边界防御算法
Efficient Algorithms for Boundary Defense with Heterogeneous Defenders
摘要：
本文研究了一个异质的防御者组的防御（一维和二维）边界对大量的连续攻击的问题。防御者团队在一定时间（有限或无限）范围内拥有攻击事件的完美信息，目标是拦截尽可能多的攻击。如果防御者在攻击发生的时间和地点出现在边界位置，则认为攻击被成功拦截。通过提出基于网络流和整数规划的计算最优解的方法，以及计算近优解的穷举防御者配对探试法，与现有技术相比，能够显着降低求解问题的计算负担，大量的仿真实验证实了算法的有效性。利用我们的有效方法，我们还描述了解决方案的结构，揭示了攻击拦截率和各种问题参数之间的关系，例如，防御者的异质性、攻击率、边界拓扑和前瞻视野。
英文摘要：
This paper studies the problem of defending (1D and 2D) boundaries against a large number of continuous attacks with a heterogeneous group of defenders. The defender team has perfect information of the attack events within some time (finite or infinite) horizon, with the goal of intercepting as many attacks as possible. An attack is considered successfully intercepted if a defender is present at the boundary location when and where the attack happens. Through proposing a network-flow and integer programming-based method for computing optimal solutions, and an exhaustive defender pairing heuristic method for computing near-optimal solutions, we are able to significantly reduce the computation burden in solving the problem in comparison to the previous state of the art. Extensive simulation experiments confirm the effectiveness of the algorithms. Leveraging our efficient methods, we also characterize the solution structures, revealing the relationships between the attack interception rate and the various problem parameters, e.g., the heterogeneity of the defenders, attack rate, boundary topology, and the look-ahead horizon.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
