Controllability of Multi-Agent Dynamical Systems with a Broadcasting Control Signal
From MaRDI portal
Publication:2930801
DOI10.1002/asjc.793zbMath1300.93043OpenAlexW2139122353MaRDI QIDQ2930801
Myung-Gon Yoon, Zoran Stanić, Peter Rowlinson, Dragos Cvetković
Publication date: 19 November 2014
Published in: Asian Journal of Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/asjc.793
Applications of graph theory (05C90) Controllability (93B05) Applications of graph theory to circuits and networks (94C15) Agent technology and artificial intelligence (68T42)
Related Items
On strongly asymmetric and controllable primitive graphs, Controllability of NEPSes of graphs, Pseudo-perturbation-based broadcast control of multi-agent systems, Almost equitable partitions and new necessary conditions for network controllability, Signed graphs whose all Laplacian eigenvalues are main, Construction of graphs with distinct \(A_\alpha \)-eigenvalues, Communicability cosine distance: similarity and symmetry in graphs/networks, Construction of graphs with distinct eigenvalues
Cites Work
- Unnamed Item
- Unnamed Item
- Graph spectra in computer science
- Transfer function representation of cyclic consensus systems
- A table of connected graphs on six vertices
- Reaching a consensus via pinning control
- Some results on graph spectra
- A sufficient condition for a family of graphs being determined by their generalized spectra
- Broadcast control of multi-agent systems
- Graph spectral techniques in computer sciences
- Asymmetric and symmetric graphs
- Structural controllability
- Controllable graphs with least eigenvalue at least -2
- Controllability of Multi-Agent Systems from a Graph-Theoretic Perspective
- Stochastic Modeling and Control of Biological Systems: The Lactose Regulation System ofEscherichia Coli
- Leader‐Following Consensus of Multi‐Agent System with Diffusion
- Asymmetric graphs
