Robust synthesis for linear parameter varying systems using integral quadratic constraints

A robust synthesis algorithm is developed for a class of uncertain, linear parameter varying (LPV) systems. The uncertain system is described as an interconnection of a nominal LPV system and a block structured uncertainty. The nominal part is a “gridded” LPV system with state matrices that are arbitrary functions of the parameter. The input/output behavior of the uncertainty is described by integral quadratic constraints (IQCs). The robust synthesis problem leads to a non-convex optimization. The proposed algorithm is a coordinate-wise descent similar to the well-known DK iteration for μμ synthesis. It alternates between an LPV synthesis step and an IQC analysis step. Both steps can be efficiently solved as semidefinite programs. The derivation of the synthesis algorithm is less obvious for LPV systems as compared to its LTI counterpart due to the lack of a valid frequency response interpretation. The main contribution is the construction of the iterative synthesis algorithm using time domain dissipation inequalities and a scaled system analogous to that appearing in μμ synthesis. It is shown that the proposed algorithm ensures that the robust performance is non-increasing at each iteration step. The effectiveness of the proposed method is demonstrated on a simple numerical example.