Controllability, identification, and randomness in distributed systems
From MaRDI portal
Recommendations
- Design of distributed and robust optimization algorithms. A systems theoretic approach
- Cooperative coordination and formation control for multi-agent systems. Doctoral Thesis accepted by The Australian National University, Canberra, Australia
- Analysis and synthesis of dynamic systems with positive characteristics
- Product of Random Stochastic Matrices and Distributed Averaging
- Towards to dynamic optimal control for large-scale distributed systems
Cited in
(5)- Eigenvectors and controllability of non-Hermitian random matrices and directed graphs
- Physics informed topology learning in networks of linear dynamical systems
- Common randomness and distributed control: A counterexample
- On a Conjecture of Godsil Concerning Controllable Random Graphs
- Controllability of network opinion in Erdös-Rényi graphs using sparse control inputs
This page was built for publication: Controllability, identification, and randomness in distributed systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2953890)