A Least Squares Approach to the Subspace Identification Problem - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2008

A Least Squares Approach to the Subspace Identification Problem

Laurent Bako
Stéphane Lecoeuche

Résumé

In this paper, we propose a new method for the identification of linear Multiple Inputs-Multiple Outputs (MIMO) systems. By introducing a particular user-defined matrix that does not change the rank of the extended observability matrix when multiplying this latter matrix on the left, the subspace identification problem is recasted into a simple least squares problem with all regressors available. Therefore, the Singular Value Decomposition algorithm which is a customary tool in subspace identification can be avoided, thus making our method appealing for recursive implementation. The technique is such that the state coordinates basis of the estimated matrices is completely determined by the aforementioned user-defined matrix, that is, given such a matrix, the state basis of the identified matrices does not change with respect to the realization of input-output data.
Fichier principal
Vignette du fichier
Bako-et-al-CDC08.pdf (271.96 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00336416 , version 1 (04-11-2008)

Identifiants

  • HAL Id : hal-00336416 , version 1

Citer

Laurent Bako, Guillaume Mercère, Stéphane Lecoeuche. A Least Squares Approach to the Subspace Identification Problem. 47th IEEE Conference on Decision and Control, Dec 2008, Cancun, Mexico. pp.1-6. ⟨hal-00336416⟩
52 Consultations
461 Téléchargements

Partager

Gmail Facebook X LinkedIn More