Controllability of Multi-Agent Dynamical Systems with a Broadcasting Control Signal

DOI10.1002/asjc.793zbMath1300.93043MaRDI 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

zbMATH Keywords

controllability; spectral graph theory; multi-agent dynamical system; broadcasting control

Mathematics Subject Classification ID

05C90: Applications of graph theory

93B05: Controllability

94C15: Applications of graph theory to circuits and networks

68T42: Agent technology and artificial intelligence

Related Items

Controllability of NEPSes of graphs, 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, On strongly asymmetric and controllable primitive graphs, Construction of graphs with distinct eigenvalues, Pseudo-perturbation-based broadcast control of multi-agent systems, Almost equitable partitions and new necessary conditions for network controllability

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