arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1909.03989eess.SYcs.SYmath.OC
收藏

任意凸集上的边界防御对策

Perimeter-defense Game on Arbitrary Convex Shapes

Daigo Shishika, Vijay Kumar

摘要:

本文研究了入侵者和防御者之间的多人到达-回避博弈的一种变体。入侵者队试图通过将尽可能多的入侵者送到目标区域来得分,而防守者队则试图通过拦截他们来最小化得分。具体来说,我们考虑的情况下,防御者被限制在目标区域的周边移动。由于联合状态空间的高维性,直接求解多人博弈具有挑战性,因此我们利用较小规模问题的解决方案。首先,我们解决了一对一的游戏,现有的作品要么依赖于数值方法,要么做出简化的假设(例如,圆周或等速度)。本文适用于任何凸形的目标区域,并提供了一个有用的几何解释的解析解。我们还提供了一个详细的讨论所得出的策略的最优性。其次,我们解决了两个对一个游戏,引入了一个合作的钳形机动,其中一对防守者合作捕获入侵者,而入侵者不能被任何一个防守者单独捕获。最后,我们将介绍如何在三种不同的基于分配的防御策略中使用上述构建块。

英文摘要:

This paper studies a variant of multi-player reach-avoid game played between intruders and defenders. The intruder team tries to score by sending as many intruders as possible to the target area, while the defender team tries to minimize this score by intercepting them. Specifically, we consider the case where the defenders are constrained to move on the perimeter of the target area. Since it is challenging to directly solve the multi-player game due to the high dimensionality of the joint state space, we leverage the solutions to smaller scale problems. First, we solve the one vs. one game, for which existing works either rely on numerical approaches or make simplifying assumptions (e.g., circular perimeter, or equal speed). This paper accommodates target areas with any arbitrary convex shapes and provides analytical solution which lends itself to a useful geometric interpretation. We also provide a detailed discussion on the optimality of the derived strategies. Secondly, we solve the two vs. one game to introduce a cooperative pincer maneuver, where a pair of defenders team up to capture an intruder that cannot be captured by either one of the defender individually. Finally, we introduce how the aforementioned building blocks are used in three different assignment-based defense strategies.

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

↑