矩阵权重的多智能体符号网络的可控性  

Controllability of matrix-weight multi-agent signed networks

作　　者：妙锁霞[1] 凌和良[1] 杨金戈 MIAO Suoxia;LING Heliang;YANG Jinge(School of Sciences,Nanchang Institute of Technology,Nanchang 330099,China)

机构地区：[1]南昌工程学院理学院,江西南昌330099

出　　处：《南昌工程学院学报》2023年第4期100-103,共4页Journal of Nanchang Institute of Technology

基　　金：江西省教育厅科学技术研究项目(GJJ211922);国家自然科学基金项目(62263024)。

摘　　要：从图等价划分的角度,研究了矩阵权重有向符号网络上多智能体系统的可控性问题。利用符号矩阵权重网络的平衡划分,结合矩阵论,给出了可控子空间的上界以及系统不可控的条件。最后通过实例对理论结果进行了验证。This paper studies the controllability problem of multi-agent systems with matrix-weighted cooperative and competitive directed networks from the perspective of graph equivalent partition,which is a generalization of scalar-weighted networks.By using the signed matrix-weighted equivalent partition of matrix-weighted networks and matrix theory,the upper bound of controllable subspace and the uncontrollable condition of the multi-agent systems are given.Finally,the theoretical results are verified by an example.

关 键 词：可控性 多智能体系统 矩阵权重 符号网络 

分 类 号：TP13[自动化与计算机技术—控制理论与控制工程]