Recursive grid methods to compute value sets and Horowitz–Sidi bounds

DOI10.1002/RNC.1083MaRDI QIDQ3418070zbMATH OpenOpenAlexFDO

Authors P.-O. Gutman, Mattias Nordin, Bnayahu Cohen

Publication date 2 February 2007

Published in International Journal of Robust and Nonlinear Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/rnc.1083

zbMATH Keywords

bound generationquantitative feedback theory (QFT)robust controltemplate generation

Mathematics Subject Classification ID

Sensitivity (robustness) (93B35) Feedback control (93B52) Frequency-response methods in control theory (93C80)

Recommendations

• Efficient algorithm for computing QFT bounds
• Improvements on the computation of boundaries in QFT
• Set membership approach for reducing value sets in the frequency domain
• Analytical formulation to compute QFT bounds: The envelope method
• A bound for the magnitude characteristics of nonlinear output frequency response functions Part 2: Practical computation of the bound for systems described by the nonlinear autoregressive model with exogenous input

Cites work

• Quantitative feedback theory. Fundamentals and applications.

Cited in

(3)

• A new view of anti-windup design for uncertain linear systems in the frequency domain
• Generation of QFT bounds for robust tracking specifications for plants with affinely dependent uncertainties
• Efficient algorithm for computing QFT bounds

Describes a project that uses

Uses Software

• Matlab
• Qsyn

This page was built for publication: Recursive grid methods to compute value sets and Horowitz–Sidi bounds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3418070)