Robust anti-windup synthesis for directionality compensation
Research output: Contribution to journal › Article › peer-review
Standard Standard
In: IFAC Proceedings Volumes (IFAC-PapersOnline), Vol. 45, No. 13, 24.06.2012, p. 276-281.
Research output: Contribution to journal › Article › peer-review
HarvardHarvard
APA
CBE
MLA
VancouverVancouver
Author
RIS
TY - JOUR
T1 - Robust anti-windup synthesis for directionality compensation
AU - Adegbege, A.A.
AU - Heath, W.P.
PY - 2012/6/24
Y1 - 2012/6/24
N2 - We develop new robust synthesis procedures for linear and open-loop exponentially stable multivariable plants subject to input nonlinearities expressed by a quadratic program and incorporating infinity-norm bounded plant uncertainties. The resulting anti-windup control falls into a class of compensators commonly termed directionality compensation. We note that the input-output maps of both the nonlinearities and the uncertainties satisfy certain integral quadratic constraints (IQCs). Thus, the anti-windup synthesis can be reduced to a feasibility problem involving a set of linear matrix inequalities (LMIs). The well-posedness condition of the algebraic loop arising from the anti-windup interconnection is equivalent to the existence and uniqueness of a solution to a convex optimization problem for which efficient solutions are well established. We demonstrate the effectiveness of the design compared to several schemes using a highly ill-conditioned benchmark example
AB - We develop new robust synthesis procedures for linear and open-loop exponentially stable multivariable plants subject to input nonlinearities expressed by a quadratic program and incorporating infinity-norm bounded plant uncertainties. The resulting anti-windup control falls into a class of compensators commonly termed directionality compensation. We note that the input-output maps of both the nonlinearities and the uncertainties satisfy certain integral quadratic constraints (IQCs). Thus, the anti-windup synthesis can be reduced to a feasibility problem involving a set of linear matrix inequalities (LMIs). The well-posedness condition of the algebraic loop arising from the anti-windup interconnection is equivalent to the existence and uniqueness of a solution to a convex optimization problem for which efficient solutions are well established. We demonstrate the effectiveness of the design compared to several schemes using a highly ill-conditioned benchmark example
U2 - 10.3182/20120620-3-DK-2025.00039
DO - 10.3182/20120620-3-DK-2025.00039
M3 - Erthygl
VL - 45
SP - 276
EP - 281
JO - IFAC Proceedings Volumes (IFAC-PapersOnline)
JF - IFAC Proceedings Volumes (IFAC-PapersOnline)
IS - 13
ER -