Pole Assignment in Uncertain Systems
Tallennettuna:
| Julkaisussa: | PQDT - Global (1998) |
|---|---|
| Päätekijä: | |
| Julkaistu: |
ProQuest Dissertations & Theses
|
| Aiheet: | |
| Linkit: | Citation/Abstract Full Text - PDF |
| Tagit: |
Ei tageja, Lisää ensimmäinen tagi!
|
| Abstrakti: | In this thesis, the pole assignment problem is examined for systems with parametric uncertainty. The classical pole assignment problem is generalised in the sense that the set of pole assignment compensators that give a solution to a particular pole assignment problem is considered. The use of computer algebra methods makes it easy to obtain such general solutions.A unification of dyadic state feedback pole assignment methods, which provides a basic understanding of many pole assignment techniques, is given as a first step. Then, several techniques for the classical pole assignment problem are summarized in the context of the general pole assignment problem.As a central development, a well known theorem by Davison and Wang (1973) is generalised and as a result a general solution method, which is called the Generalised Mapping Approach, to the full-rank state-feedback pole assignment problem is obtained. This approach is then extended to the output-feedback case for both static and dynamic compensators. These techniques not only provide solutions for the general pole assignment problem, but also improve many results in the literature from the classical pole assignment problem point of view.A recent development by Ho et al. (1997a) in finding low order stabilizing controllers for single input single output systems is also generalised to the multivariable case with the help of the techniques mentioned above. In particular, it is shown that it is possible to find the symbolic form of compensators that assign some of the closed-loop system poles, and simultaneously obtain conditions for internal and external stability of the closed-loop system.Last but not least, a technique is proposed to find robust pole assignment compensators. Using this technique, it is possible to reduce the synthesis problem to an analysis problem in many cases. Further problems such as increasing the real stability radius and zero assignment are also considered towards the end of the thesis. |
|---|---|
| ISBN: | 9798352958285 |
| Lähde: | ProQuest Dissertations & Theses Global |