Go to:
Logótipo
Comuta visibilidade da coluna esquerda
Você está em: Start > Publications > View > LPV system identification using a separable least squares support vector machines approach
Publication

Publications

LPV system identification using a separable least squares support vector machines approach

Title
LPV system identification using a separable least squares support vector machines approach
Type
Article in International Conference Proceedings Book
Year
2014
Authors
Azevedo Perdicoulis, TP
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. View Authenticus page Without ORCID
Ramos, JA
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Deshpande, S
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Rivera, DE
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Jorge Martins de Carvalho
(Author)
FEUP
View Personal Page You do not have permissions to view the institutional email. Search for Participant Publications View Authenticus page Without ORCID
Conference proceedings International
Pages: 2548-2554
2014 53rd IEEE Annual Conference on Decision and Control, CDC 2014
15 December 2014 through 17 December 2014
Other information
Authenticus ID: P-00G-BYR
Abstract (EN): In this article, an algorithm to identify LPV State Space models for both continuous-time and discrete-time systems is proposed. The LPV state space system is in the Companion Reachable Canonical Form. The output vector coefficients are linear combinations of a set of a possibly infinite number of nonlinear basis functions dependent on the scheduling signal, the state matrix is either time invariant or a linear combination of a finite number of basis functions of the scheduling signal and the input vector is time invariant. This model structure, although simple, can describe accurately the behaviour of many nonlinear SISO systems by an adequate choice of the scheduling signal. It also partially solves the problems of structural bias caused by inaccurate selection of the basis functions and high variance of the estimates due to over-parameterisation. The use of an infinite number of basis functions in the output vector increases the flexibility to describe complex functions and makes it possible to learn the underlying dependencies of these coefficients from the data. A Least Squares Support Vector Machine (LS-SVM) approach is used to address the infinite dimension of the output coefficients. Since there is a linear dependence of the output on the output vector coefficients and, on the other hand, the LS-SVM solution is a nonlinear function of the state and input matrix coefficients, the LPV system is identified by minimising a quadratic function of the output function in a reduced parameter space; the minimisation of the error is performed by a separable approach where the parameters of the fixed matrices are calculated using a gradient method. The derivatives required by this algorithm are the output of either an LTI or an LPV (in the case of a time-varying SS matrix) system, that need to be simulated at every iteration. The effectiveness of the algorithm is assessed on several simulated examples.
Language: English
Type (Professor's evaluation): Scientific
No. of pages: 7
Documents
We could not find any documents associated to the publication.
Recommend this page Top
Copyright 1996-2025 © Faculdade de Direito da Universidade do Porto  I Terms and Conditions  I Acessibility  I Index A-Z
Page created on: 2025-07-15 at 16:21:04 | Privacy Policy | Personal Data Protection Policy | Whistleblowing