TY - GEN

T1 - Identification of LPV state space systems by a separable least squares approach

AU - Lopes Dos Santos, P.

AU - Azevedo-Perdicoúlis, T. P.

AU - Ramos, J. A.

AU - Martins De Carvalho, J. L.

AU - Rivera, Daniel

N1 - Copyright:
Copyright 2014 Elsevier B.V., All rights reserved.

PY - 2013

Y1 - 2013

N2 - In this article, an algorithm to identify LPV State Space models is proposed. The LPV State Space system is in the companion reachable canonical form. Both the state matrix and the output vector coefficients are linear combinations of a set of nonlinear basis functions dependent on the scheduling signal. This model structure, although simple, can describe accurately the behaviour of many nonlinear systems by an adequate choice of the scheduling signal. The identification algorithm minimises a quadratic criterion of the output error. Since this error is a linear function of the output vector parameters, a separable nonlinear least squares approach is used to minimise the criterion function by a gradient method. The derivatives required by the algorithm are the states of LPV systems that need to be simulated at every iteration. The effectiveness of the algorithm is assessed by two simulated examples.

AB - In this article, an algorithm to identify LPV State Space models is proposed. The LPV State Space system is in the companion reachable canonical form. Both the state matrix and the output vector coefficients are linear combinations of a set of nonlinear basis functions dependent on the scheduling signal. This model structure, although simple, can describe accurately the behaviour of many nonlinear systems by an adequate choice of the scheduling signal. The identification algorithm minimises a quadratic criterion of the output error. Since this error is a linear function of the output vector parameters, a separable nonlinear least squares approach is used to minimise the criterion function by a gradient method. The derivatives required by the algorithm are the states of LPV systems that need to be simulated at every iteration. The effectiveness of the algorithm is assessed by two simulated examples.

UR - http://www.scopus.com/inward/record.url?scp=84902337776&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84902337776&partnerID=8YFLogxK

U2 - 10.1109/CDC.2013.6760518

DO - 10.1109/CDC.2013.6760518

M3 - Conference contribution

AN - SCOPUS:84902337776

SN - 9781467357173

T3 - Proceedings of the IEEE Conference on Decision and Control

SP - 4104

EP - 4109

BT - 2013 IEEE 52nd Annual Conference on Decision and Control, CDC 2013

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 52nd IEEE Conference on Decision and Control, CDC 2013

Y2 - 10 December 2013 through 13 December 2013

ER -