Abstract | ||
---|---|---|
This technical note deals with the robust exact pole placement problem: pole placement algorithms that guarantee a small variation of the assigned poles against possible perturbations. The solution to this problem is related to the solvability of a Sylvester-like equation. Thus, the main issue is to compute a well-conditioned solution to this equation. Also, the best candidate solution must possess the minimal condition number, to reduce sensitivity to perturbation. This problem is cast as a global optimization under linear matrix inequality constraints, for which a numerical convergent algorithm is provided and compared with the most attractive methods in the literature. |
Year | DOI | Venue |
---|---|---|
2009 | 10.1109/TAC.2008.2008358 | IEEE Trans. Automat. Contr. |
Keywords | DocType | Volume |
Robustness,State feedback,Equations,Linear matrix inequalities,Constraint optimization,Eigenvalues and eigenfunctions,Control theory,MATLAB,Open loop systems,Control systems | Journal | 54 |
Issue | ISSN | Citations |
2 | 0018-9286 | 2 |
PageRank | References | Authors |
0.38 | 3 | 6 |
Name | Order | Citations | PageRank |
---|---|---|---|
Mustapha Ait Rami | 1 | 143 | 10.15 |
Samira El Faiz | 2 | 2 | 0.38 |
Abdellah Benzaouia | 3 | 246 | 25.20 |
Fernando Tadeo | 4 | 173 | 18.19 |
M. Ait Rami | 5 | 291 | 39.12 |
El Faiz, S. | 6 | 2 | 0.38 |