Computation of QFT bounds for robust tracking specifications
From MaRDI portal
Publication:1596491
Recommendations
- Generation of QFT bounds for robust tracking specifications for plants with affinely dependent uncertainties
- Efficient algorithm for computing QFT bounds
- Improvements on the computation of boundaries in QFT
- Interval QFT: a mathematical and computational enhancement of QFT
- QFT bounds for robust stability specifications defined on the open-loop function
Cites work
- scientific article; zbMATH DE number 3113583 (Why is no real title available?)
- scientific article; zbMATH DE number 3233991 (Why is no real title available?)
- A new approach to optimum loop synthesis
- A simple geometrical technique for determining loop frequency response bounds which achieve prescribed sensitivity specifications
- An Efficient Algorithm for Computing QFT Bounds
- Analytic Loop Shaping Methods in Quantitative Feedback Theory
- Direct control design in sampled-data uncertain systems
- Invited paper Survey of quantitative feedback theory (QFT)
- Multi‐input/single‐output computer‐aided control design using the quantitative feedback theory
- On the Generation of QFT Bounds for General Interval Plants
- Single-Loop QFT Design for Robust Performance in the Presence of Non-Parametric Uncertainties
- Template generation for continuous transfer functions using interval analysis
Cited in
(5)- Efficient algorithm for computing QFT bounds
- Interval QFT: a mathematical and computational enhancement of QFT
- Generation of QFT bounds for robust tracking specifications for plants with affinely dependent uncertainties
- QFT bounds for robust stability specifications defined on the open-loop function
- Improvements on the computation of boundaries in QFT
This page was built for publication: Computation of QFT bounds for robust tracking specifications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1596491)