On multi-consensus and almost equitable graph partitions
From MaRDI portal
Publication:1737801
DOI10.1016/j.automatica.2019.01.021zbMath1415.93025OpenAlexW2912352567MaRDI QIDQ1737801
Salvatore Monaco, Lorenzo Ricciardi Celsi
Publication date: 24 April 2019
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11573/1334095
Applications of graph theory (05C90) Decentralized systems (93A14) Stability of control systems (93D99) Agent technology and artificial intelligence (68T42)
Related Items (11)
Cluster partitioning of heterogeneous multi-agent systems ⋮ Three conjectures of Ostrander on digraph Laplacian eigenvectors ⋮ Topology-induced containment for general linear systems on weakly connected digraphs ⋮ Multiconsensus induced by network symmetries ⋮ Invariant Synchrony Subspaces of Sets of Matrices ⋮ Topological approach and analysis of clustering in consensus networks ⋮ Multi‐consensus recovery of multi‐agent system with cyber‐attack based on topology reconstruction controller ⋮ Multiconsensus of nonlinear multiagent systems with intermittent communication ⋮ Consensus for clusters of agents with cooperative and antagonistic relationships ⋮ Symmetry induced group consensus ⋮ Hybrid consensus for multi-agent systems with time-driven jumps
Cites Work
- Unnamed Item
- On the cluster consensus of discrete-time multi-agent systems
- Distributed coordination of multi-agent networks. Emergent problems, models, and issues.
- Laplacian eigenvectors and eigenvalues and almost equitable partitions
- Emergence and evolution of multiple clusters of attracting agents
- On the spectra of nonsymmetric Laplacian matrices
- Group consensus in multi-agent systems with switching topologies and communication delays
- Disturbance decoupling problem for multi-agent systems: a graph topological approach
- Kernels of directed graph Laplacians
- Multi-Consensus of Nonlinearly Networked Multi-Agent Systems
- Convergence of Infinite Products of Stochastic Matrices: A Graphical Decomposition Criterion
- Upper and Lower Bounds for Controllable Subspaces of Networks of Diffusively Coupled Agents
- Continuous-Time Average-Preserving Opinion Dynamics with Opinion-Dependent Communications
- Graph partitions and cluster synchronization in networks of oscillators
- Discrete-Time Selfish Routing Converging to the Wardrop Equilibrium
- Coordination of groups of mobile autonomous agents using nearest neighbor rules
- Stability of multiagent systems with time-dependent communication links
This page was built for publication: On multi-consensus and almost equitable graph partitions
