Almost equitable partitions and new necessary conditions for network controllability
From MaRDI portal
Publication:2407159
Recommendations
- Controllability of multi-agent systems from a graph-theoretic perspective
- Controllability of undirected graphs
- Almost equitable partitions and controllability of leader-follower multi-agent systems
- Graph-theoretic characterization of controllability for multi-agent systems
- Controllability of multi-agent systems under directed topology
Cites work
- Asymmetric graphs
- Controllability and Observability of Grid Graphs via Reduction and Symmetries
- Controllability and Observability of Network-of-Networks via Cartesian Products
- Controllability of Multi-Agent Dynamical Systems with a Broadcasting Control Signal
- Controllability of multi-agent systems from a graph-theoretic perspective
- Controllable subsets in graphs
- Disturbance decoupling problem for multi-agent systems: a graph topological approach
- Graph Controllability Classes for the Laplacian Leader-Follower Dynamics
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 53165 (Why is no real title available?)
- scientific article; zbMATH DE number 1418964 (Why is no real title available?)
- scientific article; zbMATH DE number 3031989 (Why is no real title available?)
- Laplacian controllability classes for threshold graphs
- Laplacian eigenvectors and eigenvalues and almost equitable partitions
- Leaders in multi-agent controllability under consensus algorithm and tree topology
- On the Controllability Properties of Circulant Networks
- On the Reachability and Observability of Path and Cycle Graphs
- Patterns of Synchrony in Coupled Cell Networks with Multiple Arrows
- Practical graph isomorphism. II.
- Projection-Based Model Reduction of Multi-Agent Systems Using Graph Partitions
- Random matrices have simple spectrum
- Symmetry Groupoids and Patterns of Synchrony in Coupled Cell Networks
- Symmetry in complex networks
- Upper and Lower Bounds for Controllable Subspaces of Networks of Diffusively Coupled Agents
- Zero Forcing Sets and Controllability of Dynamical Systems Defined on Graphs
Cited in
(18)- Controllability of multi-agent systems with directed and weighted signed networks
- A criterion for stability of cluster synchronization in networks with external equitable partitions
- Controllability of Kronecker product networks
- Characterizing controllable subspace and herdability of signed weighted networks via graph partition
- Controllability of undirected graphs
- Almost equitable partitions and controllability of leader-follower multi-agent systems
- On stable systems with random structure
- Controlling consensus in networks with symmetries
- Invariant synchrony subspaces of sets of matrices
- Controllability and observability of multi-agent systems with general linear dynamics under switching topologies
- Controllability of multi-agent systems from a graph-theoretic perspective
- Clustering-based average state observer design for large-scale network systems
- Minimal control placement of networked reaction-diffusion systems based on Turing model
- Spectrum computation and optimization for controllability Gramian of networked Laplacian systems with limited control placement
- Minimum leader selection for controllability of undirected graphs with leader-follower framework
- Herdability of switching signed networks
- Fundamental structures of invariant dual subspaces with respect to a Boolean network
- Controllability and observability of networked singular systems
This page was built for publication: Almost equitable partitions and new necessary conditions for network controllability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2407159)
