Graph-theoretic methods for networked dynamic systems: heterogeneity and H₂ performance

DOI10.1007/978-1-4419-5757-3_9zbMATH Open1237.93011OpenAlexW2120480928WikidataQ57719073 ScholiaQ57719073MaRDI QIDQ3171874FDOQ3171874

Daniel Zelazo, Mehran Mesbahi

Publication date: 5 October 2011

Published in: Efficient Modeling and Control of Large-Scale Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4419-5757-3_9

Recommendations

• Multi-agent systems
• Graph theoretic methods in multiagent networks
• \(H_2\) performance analysis and \(H_2\) distributed control design for systems interconnected over an arbitrary graph
• Modelling, analysis, and control of networked dynamical systems
• A scalable controller synthesis method for the robust control of networked systems

zbMATH Keywords

multi-agent systemscontinuous linear time-invariant systemsinterconnection topology of subsystemsnetworked dynamic systems (NDS)synthesis of large-scale systems

Mathematics Subject Classification ID

Controllability (93B05) Large-scale systems (93A15) Observability (93B07) Synthesis problems (93B50) Design techniques (robust design, computer-aided design, etc.) (93B51)

Cited In (3)

• Structure and stability of the equilibrium set in potential-driven flow networks
• Network‐based robust performance analysis for uncertain systems interconnected over an undirected graph
• \(\mathcal L_2\) optimal decentralised static output feedback stabilisation of a network of dynamical systems

This page was built for publication: Graph-theoretic methods for networked dynamic systems: heterogeneity and \({\mathcal H}_2\) performance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3171874)