论文标题
游戏可控性的拓扑结构
The topology in the game controllability of multiagent systems
论文作者
论文摘要
在本文中,当调节器的控制不为零时,介绍了基于图的基于图的控制性的条件。一个可以很好地描述现实主义表达为基于游戏的控制系统(GBC)的控制框架,在2019年获得了,不幸的是,该系统在理论上无法验证,并且认为调节器控制输入为零。但是,基于一个新的概念,即策略矩阵,我们提出了一个图理论条件来判断GBC的可控性,而不是使用代数条件进行复杂的数学计算。更具体地说,要解决这些问题,当监管机构控制不为零时,需要研究NASH平衡动作的表达。基于此表达式,获得了游戏可控性矩阵的一般公式,该公式为研究拓扑对基于游戏的控制系统的基本影响提供了理论支持。通用公式始终受特定的矩阵策略矩阵的影响,该矩阵由NASH平衡动作组成,并且矩阵不仅可以通过矩阵计算获得,而且可以通过拓扑直接编写,这是拓扑对GBC的特定影响。最后,我们获得了直接根据拓扑结构直接判断系统的可控性的结果,并提出了以下猜想:GBC中没有限制等效分区。可以说,这是图表的等效分区的一个令人惊讶的猜想,因为到目前为止,仅在fivenode图中仅解决了等效分区的限制
In this paper, the graph based condition for the controllability of game based control system is presented when the control of regulator is not zero. A control framework which can describe realism well expressed as the game based control system (GBCS), was obtained in 2019, which, unfortunately, is not graph theoretically verifiable, and the regulator control input is assumed to be zero. However, based on a new established notion, strategy matrix, we propose a graph theory condition to judge the controllability of GBCS, instead of using algebraic conditions for complex mathematical calculations. More specifically, to tackle these issues, one needs to study the expression of Nash equilibrium actions when regulators control is not zero first. Based on this expression, the general formula of game controllability matrix is obtained, which provides theoretical support for studying the essential influence of topology on game based control system. The general formula is always affected by the specific matrix strategy matrix, composed of Nash equilibrium actions, and the matrix can not only be obtained by matrix calculation, but also can be directly written through the topology, which is the specific influence of the topology on the GBCS. Finally, we obtain the result of judging the controllability of the system directly according to the topological structure, and put forward the conjecture that there is no limitation of equivalent partition in GBCS. Arguably, this is a surprising conjecture on the equivalent partition of graphs, because only the limitation of equivalent partition in fivenode graphs has been solved so far