Matrix-weighted consensus and its applications
From MaRDI portal
(Redirected from Publication:1640299)
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.
Recommendations
- Cluster consensus on matrix-weighted switching networks
- Matrix-weighted consensus for multi-agent systems with sampled-data
- Weighted consensus of discrete-time multi-agent system
- Weighted consensus problem for multiagent systems with edge- and node-weighted directed graphs
- Multi-consensus of nonlinearly networked multi-agent systems
Cites work
- Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
- Consensus and Cooperation in Networked Multi-Agent Systems
- Distributed formation control via global orientation estimation
- Edge Agreement: Graph-Theoretic Performance Bounds and Passivity Analysis
- Graph theoretic methods in multiagent networks
- Localizability and distributed protocols for bearing-based network localization in arbitrary dimensions
- Network science on belief system dynamics under logic constraints
- Synchronization under matrix-weighted Laplacian
Cited in
(26)- Expansion in matrix-weighted graphs
- Topological approach and analysis of clustering in consensus networks
- Path Laplacian matrices: introduction and application to the analysis of consensus in networks
- Algebraic criteria for consensus problems of continuous-time networked systems
- Distributed Weight Selection in Consensus Protocols by Schatten Norm Minimization
- From Matrix-Weighted Consensus to Multipartite Average Consensus
- A generalization of the graph Laplacian with application to a distributed consensus algorithm
- Characterizing bipartite consensus on signed matrix-weighted networks via balancing set
- Synchronization analysis of linear time-varying matrix-weighted coupled systems and its applications
- Synchronization of small oscillations
- Matrix-weighted consensus for multi-agent systems with sampled-data
- Weighted consensus problem for multiagent systems with edge- and node-weighted directed graphs
- A note on the diagonally stable matrix induced from graph Laplacian
- Weight allocation in Laplacian matrix of random networks based on geodesic distances
- Consensus under biased alignment
- Speeding up finite-time consensus via minimal polynomial of a weighted graph -- a numerical approach
- Distributed robust matrix-scaled consensus control of perturbed multi-agent systems
- Distributed algorithms for reaching consensus on general functions
- Disturbance observer-based matrix-weighted consensus
- Bipartite tracking for Euler-Lagrange systems via prescribed-time hierarchical control based on the matrix-weighted signed digraphs
- Event-based bipartite consensus of second-order discrete-time multi-agent systems with matrix-weighted signed networks
- Continuous-time opinion dynamics on multiple interdependent topics
- Cluster consensus for coupled harmonic oscillators under a weighted cooperative-competitive network
- Second-order observability of matrix-weight-based networks
- Cluster consensus on matrix-weighted switching networks
- Controllability for multi-agent systems with matrix-weight-based signed network
This page was built for publication: Matrix-weighted consensus and its applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1640299)
