Robust pole assignment
Soh YC., Evans RJ., Petersen IR., Betz RE.
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. © 1987.