多人边界防御对策中的合作团队策略
Cooperative Team Strategies for Multi-player Perimeter-Defense Games
摘要:
本文研究了入侵者和防守者之间的多人到达-避免博弈的一个变体,并将其应用于周界防守。入侵者队试图通过将尽可能多的入侵者送到目标区域来得分,而防守者队则试图通过拦截他们来最小化得分。由于联合状态空间的高维性,寻找博弈的最优策略具有挑战性,已有的研究工作提出了近似方法将防御策略的设计归结为分配问题。然而,他们遭受要么次优防御性能或计算复杂性。基于一种新的分解方法,本文提出了一种可扩展的(多项式时间)分配算法,以适应合作行为,并优于现有的防御策略。对于一类初始配置,我们得到的确切分数,通过显示,由入侵者队提供的下界匹配的上限提供的防御者队,这也证明了最优的团队策略。
英文摘要:
This paper studies a variant of the multi-player reach-avoid game played between intruders and defenders with applications to perimeter defense. 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. Finding the optimal strategies of the game is challenging due to the high dimensionality of the joint state space, and the existing works have proposed approximation methods to reduce the design of the defense strategy into assignment problems. However they suffer from either suboptimal defender performance or computational complexity. Based on a novel decomposition method, this paper proposes a scalable (polynomial-time) assignment algorithm that accommodates cooperative behaviors and outperforms the existing defense strategies. For a certain class of initial configurations, we derive the exact score by showing that the lower bound provided by the intruder team matches the upper bound provided by the defender team, which also proves the optimality of the team strategies.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。