论文标题
动态防御者攻击室内游戏（DDAB）中的路径防御有限
Path Defense in Dynamic Defender-Attacker Blotto Games (dDAB) with Limited Information
论文作者
论文摘要
我们考虑了动态防御者 - 攻击者Blotto Games（DDAB）中的一个路径保护问题，在该游戏中，机器人团队必须在图形中捍卫针对对抗者的路径。多机器人系统特别适合该应用程序，因为最近的工作表明了这些系统在相关领域（例如外围防御和监视）的有效性。在设计保证辩护道路的辩护政策时，有关对手和环境的信息可能会有所帮助，并可能减少辩护人为实现足够安全的资源所需的资源数量。在这项工作中，我们表征了确保DDAB游戏中两个节点之间的最短路径所需的必要和足够数量的资产，而后卫只能在最短路径的$ k $ - hops中检测资产。通过表征传感范围与所需资源之间的关系，我们表明，提高防御者的感应能力会大大减少捍卫这条路所需的防御者资产数量。
We consider a path guarding problem in dynamic Defender-Attacker Blotto games (dDAB), where a team of robots must defend a path in a graph against adversarial agents. Multi-robot systems are particularly well suited to this application, as recent work has shown the effectiveness of these systems in related areas such as perimeter defense and surveillance. When designing a defender policy that guarantees the defense of a path, information about the adversary and the environment can be helpful and may reduce the number of resources required by the defender to achieve a sufficient level of security. In this work, we characterize the necessary and sufficient number of assets needed to guarantee the defense of a shortest path between two nodes in dDAB games when the defender can only detect assets within $k$-hops of a shortest path. By characterizing the relationship between sensing horizon and required resources, we show that increasing the sensing capability of the defender greatly reduces the number of defender assets needed to defend the path.
