Skip to main navigation Skip to search Skip to main content

Robust pole assignment

  • Y. C. Soh*
  • , R. J. Evans
  • , I. R. Petersen
  • , R. E. Betz
  • *Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

80 Citations (Scopus)

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 languageEnglish
Pages (from-to)601-610
Number of pages10
JournalAutomatica
Volume23
Issue number5
DOIs
Publication statusPublished - Sept 1987
Externally publishedYes

Fingerprint

Dive into the research topics of 'Robust pole assignment'. Together they form a unique fingerprint.

Cite this