DocumentCode
3532290
Title
Identification of LPV State Space systems by a separable least squares approach
Author
Lopes dos Santos, P. ; Azevedo-Perdicoulis, T.-P. ; Ramos, J.A. ; de Carvalho, J. L. Martins ; Rivera, Daniel E.
Author_Institution
Fac. de Eng., Univ. do Porto, Porto, Portugal
fYear
2013
fDate
10-13 Dec. 2013
Firstpage
4104
Lastpage
4109
Abstract
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.
Keywords
gradient methods; identification; linear systems; matrix algebra; minimisation; quadratic programming; scheduling; vectors; LPV state space system identification; companion reachable canonical form; gradient method; iteration; linear function; linear parameter varying identification; nonlinear basis functions; output vector coefficients; output vector parameters; quadratic criterion minimisation; scheduling signal; separable nonlinear least squares approach; state matrix; Accuracy; Control systems; Educational institutions; Least squares approximations; Mathematical model; Modeling; Vectors;
fLanguage
English
Publisher
ieee
Conference_Titel
Decision and Control (CDC), 2013 IEEE 52nd Annual Conference on
Conference_Location
Firenze
ISSN
0743-1546
Print_ISBN
978-1-4673-5714-2
Type
conf
DOI
10.1109/CDC.2013.6760518
Filename
6760518
Link To Document