Computational aspects of graph theoretic methods in control
The authors use graph theoretic methods in systems and control theory, namely, in various types of control problems related to distributed control system structure design. Their equivalent graph theoretic problems and their algorithmic properties are also analysed. Only computationally easy problems (of polynomial time complexity) can be practically solved for this kind of systems. Special attention is given to particular cases where additional process information can be used to reduce the time complexity of the formulated control problems. For the entire collection see [Zbl 0892.00024].
- scientific article; zbMATH DE number 3230614
- Graphs and controllability completion problems
- scientific article; zbMATH DE number 18103
- Multivariable Control
- scientific article; zbMATH DE number 2200713
- Controllability of undirected graphs
- Graph-theoretic approach for structural controllability of two-dimensional linear systems
- scientific article; zbMATH DE number 3943036
- Graphon Control of Large-Scale Networks of Linear Systems
- Graph theoretic methods for the computation of disturbance decoupling feedback matrices for structured systems
- Some complexity problems on single input double output controllers
- Decentralised controller structure design and retrofit of process systems based on graph theory
- scientific article; zbMATH DE number 3943036 (Why is no real title available?)
- scientific article; zbMATH DE number 3693175 (Why is no real title available?)
- Using permuted graph bases in \(\mathcal{H}_\infty\) control
- scientific article; zbMATH DE number 5204750 (Why is no real title available?)
- Graph-theoretic approaches for analyzing the resilience of distributed control systems: a tutorial and survey
This page was built for publication: Computational aspects of graph theoretic methods in control
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4400814)
