期刊
AUTOMATICA
卷 73, 期 -, 页码 200-206出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.automatica.2016.07.005
关键词
Multi-agent systems; Zero-sum game; Containment control; Equilibrium topology
资金
- NSFC [61533001, 61375120, 61304160, 61563043]
- Max-Planck Society
- Fundamental Research Funds for the Central Universities [JB160419]
It is typical in containment control problems to assume that there is no conflict of interest among leaders. In this paper, we consider the situation where there is conflict between leaders; namely, the leaders compete to attract followers. The strategies of each leader are defined by choosing at most k followers to propagate their information. Then, we formulate a standard two-player zero-sum game by using graph theory and matrix theory. We further prove that each player will choose exactly k followers when the game achieves a Nash equilibrium. It is noteworthy that the interaction graph here is generated from the conflict between leaders and then the Nash equilibrium point of the game corresponds to the equilibrium topology. For the case of choosing one follower, a necessary and sufficient condition for an interaction graph to be the equilibrium topology is derived. Moreover, we can obtain the equilibrium topology directly if followers' interaction graph is a circulant graph or a graph with a center vertex. Simulation examples are provided to validate the effectiveness of the theoretical results. (C) 2016 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据