Subspace identification of linear parameter-varying systems with innovation-type noise models driven by general inputs and a measurable white noise time-varying parameter vector

Authors:
P. Lopes dos Santos;J. A. Ramos;J. L. Martins de Carvalho
Affiliations:
Faculdade de Engenharia, ISR-Porto, Universidade do Porto, Porto, Portugal;The University of Wisconsin - Stout, Menomonie, WI, USA;Faculdade de Engenharia, ISR-Porto, Universidade do Porto, Porto, Portugal
Venue:
International Journal of Systems Science - The Seventh Portuguese Conference on Automatic Control (Controlo'2006)
Year:
2008

Citing 4
Cited 1

Identification of the deterministic part of MIMO state space models given in innovations form from input-output data

Automatica (Journal of IFAC) - Special issue on statistical signal processing and control
N4SID: subspace algorithms for the identification of combined deterministic-stochastic systems

Automatica (Journal of IFAC) - Special issue on statistical signal processing and control
Newton's Method for Discrete Algebraic Riccati Equations when the Closed-Loop Matrix Has Eigenvalues on the Unit Circle

SIAM Journal on Matrix Analysis and Applications
Subspace identification of multivariable linear parameter-varying systems

Automatica (Journal of IFAC)

A convex relaxation approach to set-membership identification of LPV systems

Automatica (Journal of IFAC)

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this article, we introduce an iterative subspace system identification algorithm for MIMO linear parameter-varying systems with innovation-type noise models driven by general inputs and a measurable white noise time-varying parameter vector. The new algorithm is based on a convergent sequence of linear deterministic-stochastic state-space approximations, thus considered a Picard-based method. Such methods have proven to be convergent for the bilinear state-space system identification problem. Their greatest strength lies on the dimensions of the data matrices that are comparable to those of a linear subspace algorithm, thus avoiding the curse of dimensionality.