基于对抗代理的区域保护AdHoc通信网络维护
Maintaining Ad-Hoc Communication Network in Area Protection Scenarios with Adversarial Agents
摘要：
我们解决了一个问题，在基于图的场景中，多个移动代理之间的连接保持，以确保他们可以通信的区域保护。该问题由两个敌对的代理团队组成，它们在两个团队共享的无向图中移动。代理被放置在图的顶点;最多一个代理可以占据一个顶点;并且它们可以以无冲突的方式移动到相邻的顶点。团队的目标不对称：一个队（攻击者）的目的是入侵给定区域，而对手队（防御者）的目的是通过占领选定的顶点来保护该区域不被攻击者进入。防御者团队需要维护可见性图中其自身代理所占据的顶点的连通性。可见性图对顶点对之间的通信的可能性进行建模。我们研究的策略分配顶点被占领的防守队员阻止攻击代理的连接保持在同一时间。为了做到这一点，我们保留了一部分防御代理，这些代理不会试图阻止攻击者，而是用来支持团队的连接。策略的性能在多个基准中进行测试。策略的成功在很大程度上取决于实例的类型，因此这项工作的贡献之一是，我们为不同的实例类型确定合适的策略。
英文摘要：
We address a problem of area protection in graph-based scenarios with multiple mobile agents where connectivity is maintained among agents to ensure they can communicate. The problem consists of two adversarial teams of agents that move in an undirected graph shared by both teams. Agents are placed in vertices of the graph; at most one agent can occupy a vertex; and they can move into adjacent vertices in a conflict free way. Teams have asymmetric goals: the aim of one team - attackers - is to invade into given area while the aim of the opponent team - defenders - is to protect the area from being entered by attackers by occupying selected vertices. The team of defenders need to maintain connectivity of vertices occupied by its own agents in a visibility graph. The visibility graph models possibility of communication between pairs of vertices. We study strategies for allocating vertices to be occupied by the team of defenders to block attacking agents where connectivity is maintained at the same time. To do this we reserve a subset of defending agents that do not try to block the attackers but instead are placed to support connectivity of the team. The performance of strategies is tested in multiple benchmarks. The success of a strategy is heavily dependent on the type of the instance, and so one of the contributions of this work is that we identify suitable strategies for diverse instance types.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
