.png){kind=icon}
返回
Consensus on Matrix-Weighted Switching Networks
.png){kind=icon}
PRE
AI
DOI：10.1109/TAC.2021.3063115.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This article examines the consensus problem on matrix-weighted undirected switching networks. First, we introduce the matrix-weighted integral network for analyzing such networks. Under mild assumptions on the switching pattern of a sequence of networks, conditions under which average consensus can be achieved are then provided. It is shown that for matrix-weighted switching networks, the existence of a positive spanning tree in the associated integral network plays a crucial role in achieving average consensus. In particular, for periodic matrix-weighted switching networks, necessary and sufficient conditions for reaching average consensus is obtained from an algebraic perspective. Simulation results are provided to demonstrate the theoretical analysis.
Keyword:
Switches
Multi-agent systems
Laplace equations
Symmetric matrices
Null space
Time-varying systems
Terminology
Consensus
integral network
matrix-weighted networks
multiagent systems
switching networks
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7
论文数:
1.3W
被引数:
6.7W
机构
引用论文
.png){kind=icon}
分享收藏
Dimensional-Invariance Principles in Coupled Dynamical Systems: A Unified Analysis and Applications
OAAI
OAAI分享收藏
查看更多内容