Controllability of Multi-Agent Dynamical Systems with a Broadcasting Control Signal
DOI10.1002/ASJC.793zbMATH Open1300.93043OpenAlexW2139122353MaRDI QIDQ2930801FDOQ2930801
Authors: Myung-Gon Yoon, Zoran Stanić, P. Rowlinson, Dragoš 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
Recommendations
- Broadcast control of multi-agent systems
- Pseudo-perturbation-based broadcast control of multi-agent systems
- Controllability of multi-agent systems with input and communication delays
- Broadcast stochastic receding horizon control of multi-agent systems
- Controllability of heterogeneous multiagent systems
- On the controllability and stabilizability of non-homogeneous multi-agent dynamical systems
- Controllability and observability of switched multi-agent systems
- Controllability of multi-agent systems based on agreement protocols
- Controllability of multi-agent systems from a graph-theoretic perspective
- Control of multi-agent systems: results, open problems, and applications
Applications of graph theory (05C90) Controllability (93B05) Agent technology and artificial intelligence (68T42) Applications of graph theory to circuits and networks (94C15)
Cites Work
- Some results on graph spectra
- A sufficient condition for a family of graphs being determined by their generalized spectra
- The main eigenvalues of a graph: a survey
- Title not available (Why is that?)
- Controllable graphs with least eigenvalue at least \(-2\)
- Reaching a consensus via pinning control
- Controllability of multi-agent systems from a graph-theoretic perspective
- Structural controllability
- Graph spectra in computer science
- Broadcast control of multi-agent systems
- Asymmetric graphs
- A table of connected graphs on six vertices
- Stochastic Modeling and Control of Biological Systems: The Lactose Regulation System ofEscherichia Coli
- Transfer function representation of cyclic consensus systems
- Graph spectral techniques in computer sciences
- Asymmetric and symmetric graphs
- Leader-following consensus of multi-agent system with diffusion
Cited In (14)
- Structural controllability of networked systems with general heterogeneous subsystems
- Controllability analysis of nonlinear switched singular system on time scales
- Controllability of NEPSes of graphs
- Signed graphs whose all Laplacian eigenvalues are main
- On the controllability and stabilizability of non-homogeneous multi-agent dynamical systems
- Construction of graphs with distinct \(A_\alpha \)-eigenvalues
- Communicability cosine distance: similarity and symmetry in graphs/networks
- Optimal Signaling Policies for Decentralized Multicontroller Stabilizability Over Communication Channels
- On strongly asymmetric and controllable primitive graphs
- Almost equitable partitions and new necessary conditions for network controllability
- Controllability of the multi-agent system modeled by the threshold graph with one repeated degree
- Pseudo-perturbation-based broadcast control of multi-agent systems
- Construction of graphs with distinct eigenvalues
- Controllability for multi-agent systems with matrix-weight-based signed network
This page was built for publication: Controllability of Multi-Agent Dynamical Systems with a Broadcasting Control Signal
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2930801)
