Theory and Applications of Matrix-Weighted Consensus

Abstract

This paper proposes the matrix-weighted consensus algorithm, which is a generalization of the consensus algorithm in the literature. Given a networked dynamical system where the interconnections between agents are weighted by nonnegative definite matrices instead of nonnegative scalars, consensus and clustering phenomena naturally exist. We examine algebraic and algebraic graph conditions for achieving a consensus, and provide an algorithm for finding all clusters of a given system. Finally, we illustrate two applications of the proposed consensus algorithm in clustered consensus and in bearing-based formation control.

21 pages, 8 figures. Technical report version

Cited by in corpus (7)

• Discrete-Time Matrix-Weighted Consensus
• Cooperative opinion dynamics on multiple interdependent topics: Modeling and analysis
• Randomized Matrix Weighted Consensus
• ${\mathcal{H}}_2$ performance of series-parallel networks: A compositional perspective
• Bearing-Based Network Localization Under Randomized Gossip Protocol
• Consensus on Matrix-weighted Time-varying Networks
• Dimensional-invariance principles in coupled dynamical systems-- A unified analysis and applications