Almost equitable partitions and new necessary conditions for network controllability
From MaRDI portal
Publication:2407159
DOI10.1016/j.automatica.2017.01.018zbMath1370.93046OpenAlexW2601563346MaRDI QIDQ2407159
Cesar O. Aguilar, Bahman Gharesifard
Publication date: 28 September 2017
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2017.01.018
Controllability (93B05) Applications of graph theory to circuits and networks (94C15) Agent technology and artificial intelligence (68T42)
Related Items (10)
On Stable Systems with Random Structure ⋮ Controlling consensus in networks with symmetries ⋮ Controllability of multi-agent systems with directed and weighted signed networks ⋮ Almost equitable partitions and controllability of leader-follower multi-agent systems ⋮ Invariant Synchrony Subspaces of Sets of Matrices ⋮ Clustering-based average state observer design for large-scale network systems ⋮ A criterion for stability of cluster synchronization in networks with external equitable partitions ⋮ Controllability and observability of multi-agent systems with general linear dynamics under switching topologies ⋮ Controllability of Kronecker product networks ⋮ Characterizing controllable subspace and herdability of signed weighted networks via graph partition
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Leaders in multi-agent controllability under consensus algorithm and tree topology
- Laplacian eigenvectors and eigenvalues and almost equitable partitions
- Random matrices have simple spectrum
- Controllable subsets in graphs
- Disturbance decoupling problem for multi-agent systems: a graph topological approach
- Laplacian controllability classes for threshold graphs
- Practical graph isomorphism. II.
- Controllability of Multi-Agent Dynamical Systems with a Broadcasting Control Signal
- Graph Controllability Classes for the Laplacian Leader-Follower Dynamics
- Controllability and Observability of Network-of-Networks via Cartesian Products
- Zero Forcing Sets and Controllability of Dynamical Systems Defined on Graphs
- Upper and Lower Bounds for Controllable Subspaces of Networks of Diffusively Coupled Agents
- Symmetry Groupoids and Patterns of Synchrony in Coupled Cell Networks
- Patterns of Synchrony in Coupled Cell Networks with Multiple Arrows
- Controllability of Multi-Agent Systems from a Graph-Theoretic Perspective
- On the Reachability and Observability of Path and Cycle Graphs
- Controllability and Observability of Grid Graphs via Reduction and Symmetries
- On the Controllability Properties of Circulant Networks
- Projection-Based Model Reduction of Multi-Agent Systems Using Graph Partitions
- Asymmetric graphs
- Symmetry in complex networks
This page was built for publication: Almost equitable partitions and new necessary conditions for network controllability
