Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 601-610 |
| Number of pages | 10 |
| Journal | Automatica |
| Volume | 23 |
| Issue number | 5 |
| DOIs | |
| Publication status | Published - Sept 1987 |
| Externally published | Yes |
Fingerprint
Dive into the research topics of 'Robust pole assignment'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver