拉普拉斯矩阵
代数连通性
数学
代数图论
特征向量
生成树
拓扑(电路)
趋同(经济学)
图论
网络拓扑
共识
基质(化学分析)
图形
多智能体系统
离散数学
计算机科学
组合数学
量子力学
物理
人工智能
经济增长
复合材料
经济
材料科学
操作系统
标识
DOI:10.1016/j.jmaa.2011.08.052
摘要
This paper studies the consensus of second-order discrete-time multi-agent systems with fixed topology. First, we formulate the problem and give some preliminaries. Then, by algebraic graph theory and matrix theory, the convergence of system matrix is analyzed. Our main results indicate that the consensus of second-order system can be achieved if and only if the topology graph has a directed spanning tree and the values of the scaling parameters satisfy a range. The eigenvalues of the corresponding Laplacian matrix play a key role in reaching consensus. Finally, numerical simulations are given to illustrate the results.
科研通智能强力驱动
Strongly Powered by AbleSci AI