Robust pole assignment (Q580278)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Robust pole assignment |
scientific article; zbMATH DE number 4016704
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Robust pole assignment |
scientific article; zbMATH DE number 4016704 |
Statements
Robust pole assignment (English)
0 references
1987
0 references
This paper presents new theorems on the theory of interval matrix inequalities and the theory of polynomials with interval roots, and applies them to the problem of robust pole-placement. We formulate optimization problems and derive convergent iterative algorithms which allow the designer to find controllers that place closed-loop poles within desired intervals for plants with unknown-but-bounded parameter uncertainties. The algorithms are computationally reasonable and provide a useful addition to currently existing control CAD tools.
0 references
interval matrix inequalities
0 references
polynomials with interval roots
0 references
robust pole-placement
0 references
iterative algorithms
0 references
0 references
0 references
0 references
0.9210788
0 references
0.91992915
0 references
0.9161342
0 references
0 references
0.9125112
0 references
0.9052114
0 references
