Abstract
In this paper we present a maple-package, named SyNRAC, for solving real algebraic constraints derived from various engineering problems. Our main tool is real quantifier elimination and we focus on its application to robust control design problems.
Chapter PDF
Similar content being viewed by others
Keywords
- Symbolic Computation
- Control System Design
- Linear Formula
- Cylindrical Algebraic Decomposition
- Pole Assignment Problem
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Anai, H., Hara, S.: Fixed-structure robust controller synthesis based on sign definite condition by a special quantifier elimination. In: Proceedings of American Control Conference 2000. (2000) 1312–1316
Anai, H., Hara, S.: Linear programming approach to robust controller design by a quantifier elimination. In: Proceedings of SICE Annual Conference 2002 (Osaka, Japan). (2002) 863–869
Anai, H., Hara, S.: A parameter space approach for fixed-order robust controller synthesis by symbolic computation. In: Proceedings of IFAC World Congress on Automatic Control b’02. (2002)
González-Vega, L.: A combinatorial algorithm solving some quantifier elimination problems. In Caviness, B., Johnson, J., eds.: Quantifier Elimination and Cylindrical Algebraic Decomposition. Texts and monographs in symbolic computation. Springer-Verlag (1998) 365–375
Dolzmann, A., Sturm, T.: Simplification of quantifier-free formulae over ordered fields. Journal of Symbolic Computation 24 (1997) 209–231
Collins, G.E.: Quantifier elimination for the elementary theory of real closed fields by cylindrical algebraic decomposition. In Brakhage, H., ed.: Automata Theory and Formal Languages. 2nd GI Conference. Volume 33 of Lecture Notes in Computer Science., Gesellschaft für Informatik, Springer-Verlag, Berlin, Heidelberg, New York (1975) 134–183
Collins, G.E., Hong, H.: Partial cylindrical algebraic decomposition for quantifier elimination. Journal of Symbolic Computation 12 (1991) 299–328
González-Vega, L., Lombardi, H., Recio, T., Roy:, M.F.: Sturm-habicht sequence. In: Proceedings of ISSAC’89, Portland, ACM Press (1989) 136–146
González-Vega, L., Recio, T., Lombardi, H., Roy, M.F.: Sturm-habicht sequences determinants and real roots of univariate polynomials. In Caviness, B., Johnson, J., eds.: Quantifier Elimination and Cylindrical Algebraic Decomposition. Texts and Monographs in Symbolic Computation. Springer, Wien, New York (1998) 300–316
Weispfenning, V.: The complexity of linear problems in fields. Journal of Symbolic Computation 5 (1988) 3–27
Loos, R., Weispfenning, V.: Applying linear quantifier elimination. The Computer Journal 36 (1993) 450–462 Special issue on computational quantifier elimination.
Abdallah, C., Dorato, P., Yang, W., Liska, R., Steinberg, S.: Application of quantifier elimination theory to control system design. In: Proceedings of 4th IEEE Mediteranean Symposium on Control and Automation. Maleme, Crete. (1996) 340–345
Dorato, P., W. Yang, C. Abdallah: Robust multi-objective feedback design by quantifier elimination. J. Symb. Comp. 24 (1997) 153–159
Jirstrand, M.: Constructive Methods for Inequality Constraints in Control. PhD thesis, Linköping University, Sweden (1998)
Anai, H.: On solving semidefinite programming by quantifier elimination. In Proc. of American Control Conference, Philadelphia (1998) 2814–2818
Hara, S., Kimura, T., Kondo, R.: H∞ control system design by a parameter space approach. In: Proceedings of MTNS-91, Kobe, Japan (1991) 287–292
Kimura, T., Hara, S.: A robust control system design by a parameter space approach based on sign definition condition. In: Proceedings of KACC-91, Soul, Korea (1991) 1533–1538
Kondo, R., Hara, S., Kaneko, T.: Parameter space design for H ∞ control (in japanese). Trans. of SICE 27 (1991) 714–716
Šiljak, D.D.: New algebraic criterion for positive realness. Journal of the Franklin Institute 291 (1971) 109–120
Keel, L., Bhattacharyya, S.: Robust control under parametric uncertainty. part II: design. In: SYMBOLIC METHODS in control system analysis and design. Number 56 in IEE Control Engineering Series, IEE (1999) 203–226
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Anai, H., Yanami, H. (2003). SyNRAC: A Maple-Package for Solving Real Algebraic Constraints. In: Sloot, P.M.A., Abramson, D., Bogdanov, A.V., Dongarra, J.J., Zomaya, A.Y., Gorbachev, Y.E. (eds) Computational Science — ICCS 2003. ICCS 2003. Lecture Notes in Computer Science, vol 2657. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44860-8_86
Download citation
DOI: https://doi.org/10.1007/3-540-44860-8_86
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40194-0
Online ISBN: 978-3-540-44860-0
eBook Packages: Springer Book Archive