Nothing Special   »   [go: up one dir, main page]

skip to main content
research-article

Robust Multi-Objective Feedback Design by Quantifier Elimination

Published: 01 August 1997 Publication History

Abstract

This paper shows how certain robust multi-objective feedback design problems can be reduced to quantifier elimination (QE) problems. In particular it is shown how robust stabilization and robust frequency domain performance specifications can be reduced to systems of polynomial inequalities with suitable logic quantifiers, ∀ and ∃. Because of computational complexity the size of problems that can solved by QE methods is limited. However, the design problems considered here do not haveanalyticalsolutions, so that even the solution of modest-sized problems may be of practical interest.

Cited By

View all
  • (2024)Practical Approximate Quantifier Elimination for Non-linear Real ArithmeticFormal Methods10.1007/978-3-031-71162-6_6(111-130)Online publication date: 9-Sep-2024
  • (2018)An Algorithm to Design Pareto Optimal Controllers for Linear Systems2018 IEEE Conference on Decision and Control (CDC)10.1109/CDC.2018.8619005(5482-5487)Online publication date: 17-Dec-2018
  • (2015)Special algorithm for stability analysis of multistable biological regulatory systemsJournal of Symbolic Computation10.1016/j.jsc.2014.09.03970:C(112-135)Online publication date: 1-Sep-2015
  • Show More Cited By

Recommendations

Reviews

Luminita State

The research reported here addresses the problem of robust multi-objective feedback design in terms of mathematical logic, using new developments in quantifier elimination theory. As is well known, the general static output feedback stabilization problem is lacking an analytical solution, and the high computational complexity of the available software has discouraged interest in the theoretical results that have been obtained so far. The problem of frequency-domain robust multi-objective feedback design and a series of its typical design objectives are presented in the first two sections. Next, all of the performance objectives considered are expressed as quantified polynomial inequalities. Thus, the question of the existence of a solution is reduced to the question of quantifier elimination of the existential quantifier applied to the resulting formula. Several illustrative examples given in the fourth section lead to the conclusions formulated in the final part of the paper. This work can be viewed as an alternative method for robust multi-objective feedback design. As it is supported by the arguments supplied here, the reported technique could work efficiently, at least for some practical problems.

Access critical reviews of Computing literature here

Become a reviewer for Computing Reviews.

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Journal of Symbolic Computation
Journal of Symbolic Computation  Volume 24, Issue 2
Aug 1997
107 pages

Publisher

Academic Press, Inc.

United States

Publication History

Published: 01 August 1997

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 16 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2024)Practical Approximate Quantifier Elimination for Non-linear Real ArithmeticFormal Methods10.1007/978-3-031-71162-6_6(111-130)Online publication date: 9-Sep-2024
  • (2018)An Algorithm to Design Pareto Optimal Controllers for Linear Systems2018 IEEE Conference on Decision and Control (CDC)10.1109/CDC.2018.8619005(5482-5487)Online publication date: 17-Dec-2018
  • (2015)Special algorithm for stability analysis of multistable biological regulatory systemsJournal of Symbolic Computation10.1016/j.jsc.2014.09.03970:C(112-135)Online publication date: 1-Sep-2015
  • (2011)Construction of explicit optimal value functions by a symbolic-numeric cylindrical algebraic decompositionProceedings of the 13th international conference on Computer algebra in scientific computing10.5555/2040148.2040167(239-250)Online publication date: 5-Sep-2011
  • (2009)Efficient handling of universally quantified inequalitiesConstraints10.1007/s10601-008-9053-014:1(117-135)Online publication date: 1-Mar-2009
  • (2008)Symbolic optimization of algebraic functionsProceedings of the twenty-first international symposium on Symbolic and algebraic computation10.1145/1390768.1390791(147-154)Online publication date: 20-Jul-2008
  • (2008)An efficient algorithm for a sharp approximation of universally quantified inequalitiesProceedings of the 2008 ACM symposium on Applied computing10.1145/1363686.1363724(134-139)Online publication date: 16-Mar-2008
  • (2008)The Optimal H∞ Norm of a Parametric System Achievable by an Output Feedback ControllerIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences10.1093/ietfec/e91-a.7.1713E91-A:7(1713-1724)Online publication date: 1-Jul-2008
  • (2007)Solving and visualizing nonlinear parametric constraints in control based on quantifier eliminationApplicable Algebra in Engineering, Communication and Computing10.5555/3111965.311208418:6(497-512)Online publication date: 1-Dec-2007
  • (2007)Robust stability for parametric linear ODEsProceedings of the 10th international conference on Computer Algebra in Scientific Computing10.5555/2396194.2396226(402-422)Online publication date: 16-Sep-2007
  • Show More Cited By

View Options

View options

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media