Cluster Formation in Multiagent Consensus via Dynamic Resilient Graph Games
Cluster Formation in Multiagent Consensus via Dynamic Resilient Graph Games
复制标题
通过动态弹性图游戏在多智能体共识中形成集群
DOI：
10.1109/ccta48906.2021.9659182
复制
发表时间：
2021
期刊：
影响因子：
--
通讯作者：
Zhu, Quanyan
中科院分区：
文献类型：
--
作者：
Nugraha, Yurid;Cetinkaya, Ahmet;Hayakawa, Tomohisa;Ishii, Hideaki;Zhu, Quanyan
在本文中，我们在代表多智能体共识设置中容易受到攻击的通信通道的弹性图上制定了两人博弈论问题。攻击者能够通过发出干扰信号来断开图的部分边缘，而作为响应，防御者通过增加相应边缘上通信信号的传输功率来恢复其中一些信号。攻击者也有可能发出防御者无法克服的更强干扰信号。我们考虑重复游戏，其中每场游戏中玩家的效用取决于多个时间间隔测量的攻击/恢复性能。双方的效用主要与智能体的状态和集群形成有关，即智能体如何划分。玩家的行动受到能量传输的限制，与防御者相比，攻击者的限制不那么严格。提供了随时间推移进行的动态博弈的数值示例来演示簇的形成。
In this paper we formulate a two-player game-theoretic problem on resilient graphs representing communication channels that are vulnerable to attacks in multiagent consensus setting. An attacker is capable to disconnect part of the edges of the graph by emitting jamming signals while, in response, the defender recovers some of them by increasing the transmission power for the communication signals over the corresponding edges. It is also possible for the attacker to emit stronger jamming signals that cannot be overcome by the defender. We consider repeated games where the utilities of players in each game depend on attack/recovery performance measured over multiple intervals. The utilities of both players are mainly related to agents’ states and the cluster formation, i.e., how the agents are divided. The players’ actions are constrained by their energy for transmissions, with a less strict constraint for the attacker compared to the defender. Numerical examples of dynamic games played over time are provided to demonstrate the cluster formation.