Cerone, Vito and Piga, Dario and Regruto, Diego and Tóth, Roland
Minimal LPV state-space realization driven set-membership identification.
In:
Proceedings of American Control Conference (ACC), 2012.
IEEE, pp. 3421-3426.
ISBN 978-1-4577-1095-7
(2012)
Abstract
Set-membership identification algorithms have been recently proposed to derive linear parameter-varying (LPV) models in input-output form, under the assumption that both measurements of the output and the scheduling signals are affected by bounded noise. In order to use the identified models for controller synthesis, linear time-invariant (LTI) realization theory is usually applied to derive a statespace model whose matrices depend statically on the scheduling signals, as required by most of the LPV control synthesis techniques. Unfortunately, application of the LTI realization theory leads to an approximate state-space description of the original LPV input-output model. In order to limit the effect of the realization error, a new set-membership algorithm for identification of input/output LPV models is proposed in the paper. A suitable nonconvex optimization problem is formulated to select the model in the feasible set which minimizes a suitable measure of the state-space realization error. The solution of the identification problem is then derived by means of convex relaxation techniques.
Actions (login required)
 |
Edit Item |
