.png){kind=icon}
.png){kind=icon}
Return
Consensus on Matrix-Weighted Switching Networks
.png){kind=icon}
PRE
AI
DOI：10.1109/TAC.2021.3063115.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
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 Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7
Papers:
1.3W
Citations:
6.7W