On multi-consensus and almost equitable graph partitions
From MaRDI portal
Recommendations
- Almost equitable partitions and controllability of leader-follower multi-agent systems
- Controllability of multi-agent systems from a graph-theoretic perspective
- Controllability of multi-agent systems under directed topology
- Multi-consensus of second-order agents in discrete-time directed networks
- On topology and dynamics of consensus among linear high-order agents
Cites work
- Continuous-time average-preserving opinion dynamics with opinion-dependent communications
- Convergence of Infinite Products of Stochastic Matrices: A Graphical Decomposition Criterion
- Coordination of groups of mobile autonomous agents using nearest neighbor rules
- Discrete-Time Selfish Routing Converging to the Wardrop Equilibrium
- Distributed coordination of multi-agent networks. Emergent problems, models, and issues.
- Disturbance decoupling problem for multi-agent systems: a graph topological approach
- Emergence and evolution of multiple clusters of attracting agents
- Graph partitions and cluster synchronization in networks of oscillators
- Graph theoretic methods in multiagent networks
- Group consensus in multi-agent systems with switching topologies and communication delays
- Kernels of directed graph Laplacians
- Laplacian eigenvectors and eigenvalues and almost equitable partitions
- Multi-consensus of nonlinearly networked multi-agent systems
- On the cluster consensus of discrete-time multi-agent systems
- On the spectra of nonsymmetric Laplacian matrices
- Stability of multiagent systems with time-dependent communication links
- Upper and Lower Bounds for Controllable Subspaces of Networks of Diffusively Coupled Agents
Cited in
(19)- Topological approach and analysis of clustering in consensus networks
- Multi‐consensus recovery of multi‐agent system with cyber‐attack based on topology reconstruction controller
- Consensus and multi-consensus for discrete-time LTI systems
- Multiconsensus of nonlinear multiagent systems with intermittent communication
- Authors' reply to `Comments on ``On multi-consensus and almost equitable graph partitions
- Comments on ``On multi-consensus and almost equitable graph partitions
- Cluster partitioning of heterogeneous multi-agent systems
- Topology-induced containment for general linear systems on weakly connected digraphs
- Symmetry induced group consensus
- Multi-consensus problems in hybrid multi-agent systems
- Consensus for clusters of agents with cooperative and antagonistic relationships
- Multiconsensus induced by network symmetries
- Three conjectures of Ostrander on digraph Laplacian eigenvectors
- Event-triggered global and group consensus for linear multiagent systems with multiplicative noises
- Hybrid consensus for multi-agent systems with time-driven jumps
- Invariant synchrony subspaces of sets of matrices
- Desired group consensus in arbitrary signed networks
- On containment control for discrete-time switching networks of delayed first-order systems
- Control of multiconsensus in multi-agent systems based on eigenvector centrality
This page was built for publication: On multi-consensus and almost equitable graph partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1737801)
