有向图
拉普拉斯矩阵
代数数
共识
数学
代数连通性
代数图论
特征向量
拓扑(电路)
网络拓扑
多智能体系统
基质(化学分析)
拉普拉斯算子
数学优化
计算机科学
离散数学
组合数学
图形
操作系统
数学分析
复合材料
量子力学
物理
材料科学
人工智能
作者
Zonggang Li,Yingmin Jia
标识
DOI:10.1080/00207170802123895
摘要
This article addresses algebraic criteria for consensus problems of continuous-time networked systems with fixed and switching topology. A special eigenvector ω of the Laplacian matrix is first constructed and correlated with the connectivity of digraph. And then, some necessary and/or sufficient algebraic conditions are presented by employing the vector ω, which can directly determine whether the consensus problem can be solved. More importantly, for the switching topology case, the obtained algebraic conditions for the average consensus problem are necessary and sufficient. Furthermore, the presented results clearly show that only the agents corresponding to the positive elements of ω contribute to the group decision value and decide the collective behaviour of the system. Particularly for the fixed topology case, the role of each agent is exactly measured by the value of the corresponding element of ω. Based on these results, some extended protocols are further proposed to solve the average consensus problem, in which the interaction digraphs are not needed to be balanced. Numerical examples are included to illustrate the obtained results.
科研通智能强力驱动
Strongly Powered by AbleSci AI