Robust pole clustering op parametric uncertain systems using interval methods

IFAC Proceedings Volumes (IFAC-PapersOnline)

Volumn 36, Issue 11, 2003, Pages 323-328

  Ratschan, Stefan ^a   Vehi, Josep ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b UNIVERSITY OF GIRONA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

D REGION; LINEAR SYSTEMS; ROBUST CONTROL; UNCERTAIN SYSTEMS; UNCERTAINTY ANALYSIS;

BOUNDED UNCERTAINTY; CLOSED-LOOP POLES; CONSTRAINT PROBLEMS; ENGINEERING-ORIENTED; POLE-CLUSTERING PROBLEM; ROBUST POLE CLUSTERING; UNCERTAIN PARAMETERS; UNCERTAINTY DOMAINS;

POLES;

EID: 33645330535     PISSN: 14746670     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1016/S1474-6670(17)35684-7     Document Type: Conference Paper

References (27)

1. Ackermann, Jiirgen (1993). Robust Control. Springer.
2. Anai, H. (1998). On solving semiderinite programming by quantifier elimination. In Proc. of American Control Conference. Philadelphia pp. 2814-2818.
3. Anai, H. and V. Weispfenning (2001). Reach set computation using real quantifier elimination. In: Proceedings of International Workshop on Hybrid Systems: Computation and Control (HSCCS001). Vol. 2034 of LNCS, Springer. pp. 63-76.
4. Benhamou, Frederic and Frederic Goualard (2000). Universally quantified interval constraints. In: Proc. of the Sixth Intl. Conf, on Principles and Practice of Constraint Programming (CP'2000). number 1894 In: LNCS. Springer Verlag. Singapore.
5. Bondia, J. (2002). Sistemas con incertidumbre parametrica borrosa. Analisis y disenyo de controladores. PhD thesis. Universitat Politecnica de Valencia.
6. Caviness, B. F. and Johnson, J. R, Eds.) (1998). Quantifier Elimination and Cylindrical Algebraic Decomposition. Springer. Wien.
7. Collins, George E. (1975). Quantifier elimination for the elementary theory of real closed fields by cylindrical algebraic decomposition. pp. 134-183. In: Caviness and Johnson (1998).
8. Davenport, J. H. and J. Heintz (1988), Real quantifier elimination is doubly exponential. Journal of Symbolic Computation 5, 29-35.
9. Davis, E. (1987). Constraint propagation with interval labels. Artificial Intelligence 32(3), 281-331.
10. Dorato, P., Wei Yang and C. Abdallah (1997). Robust multi-objective feedback design by quantifier elimination. Journal of Symbolic Computation 24, 153-159.
11. Dorato, Peter (2000). Quantified multivariate polynomial inequalities. IEEE Control Systems Magazine 20(5), 48-58.
12. Granvilliers, Laurent. (2002). Realpaver. http://www.sciences.univ-nantes.fr/info/perso/permanents/granvi1/realpa%ver. software package, available free of charge.
13. Hong, Hoon (1990). Improvements in CAD-based Quantifier Elimination. PhD thesis. The Ohio State University.
14. Horst, Reiner and Pardalos, Panos M., Eds.) (1995). Handbook of Global Optimization. Kluwer.
15. Jaulin, Luc and Eric Walter (1996). Guaranteed tuning, with application to robust control and motion planning. Automatica 32(8), 1217-1221.
16. Jauhn, Luc, Michel Kieffer, Olivier Didrit and Eric Walter (2001). Applied Interval Analysis, with Examples in Parameter and State Estimation, Robust Control and Robotics. Springer. Berlin.
17. Jirstrand, Mats (1997). Nonlinear control system design by quantifier elimination. Journal of Symbolic Computation 24(2), 137-152.
18. Loos, Riidiger and Volker Weispfenning (1993). Applying linear quantifier elimination. The Computer Journal 36(5), 450-462.
19. Moore, R. E. (1966). Interval Analysis. Prentice Hall. Englewood Cliffs, NJ.
20. MuPAD (2002). http://www.aiupad.de. Software package, available free of charge for noncommercial use.
21. Nesic, Dragan and Iven M. Y. Mareels (1998). Dead beat controllability of polynomial systems: Symbolic computation approaches. IEEE Transactions on Automatic Control 43(2), 162-175.
22. Ratschan, Stefan (2000). Approximate quantified constraint solving (AQCS). http://www.rise.uni-linz.ac.at/research/software/AQCS. Software package.
23. Ratschan, Stefan (2002a), Continuous first-order constraint satisfaction. In: Artificial Intelligence, Automated Reasoning, and Symbolic Computation (J. Calmet, B. Benhamou, O. Caprotti, L. Henocque and V. Sorge, Eds.), number 2385 In: LNCS. Springer. pp. 181-195.
24. Ratschan, Stefan (20026). Search heuristics for box decomposition methods. Journal of Global Optimization 24(1), 51-60.
25. Soelemez, Mehmet Turan (1999). Pole Assignment for Uncertain Systems, number 6. UMIST Control Systems Centre Series.
26. Tarski, Alfred (1951). A Decision Method for Elementary Algebra and Geometry. Univ. of California Press. Berkeley. Also in (Caviness and Johnson 1998).
27. Weispfenning, Volker (1988). The complexity of linear problems in fields. Journal of Symbolic Computation 5(1-2), 3-27.