首页|Solvability Condition for a Class of Parametric Robust Stabilization Problem
Solvability Condition for a Class of Parametric Robust Stabilization Problem
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NETL
NSTL
The robust stabilization problem (RSP) for a plant family P(s, δ, δ) having real parameter uncertainty δ will be tackled. The coefficients of the numerator and the denominator of P(s, δ, δ) are affine functions of δ with || δ || _p ≤ δ. The robust stabilization problem for P( s, δ, δ) is essentially to simultaneously stabilize the infinitely many members of P(s, δ, δ) by a fixed controller. A necessary solvability condition is that every member plant of P( s, δ, δ ) must be stabilizable, that is, it is free of unstable pole-zero cancellation. The concept of stabilizability radius is introduced which is the maximal norm bound for δ so that every member plant is stabilizable. The stability radius δ_(max) (C) of the closed-loop system composed of P(s, δ, δ) and the controller C(s) is the maximal norm bound such that the closed-loop system is robustly stable for all δ with || δ || _p < δ_(max)(C). Using the convex parameterization approach it is shown that the maximal stability radius is exactly the stabilizability radius. Therefore, the RSP is solvable if and only if every member plant of P(s,δ,δ) is stabilizable.
NETL
NSTL
