Go to:
Logótipo
Comuta visibilidade da coluna esquerda
Você está em: Start > Publications > View > A Subspace Approach for Identifying Bilinear Systems with Deterministic Inputs
Publication

Publications

A Subspace Approach for Identifying Bilinear Systems with Deterministic Inputs

Title
A Subspace Approach for Identifying Bilinear Systems with Deterministic Inputs
Type
Article in International Conference Proceedings Book
Year
2005
Authors
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
Conference proceedings International
Pages: 7114-7119
44th IEEE Conference on Decision Control/European Control Conference (CCD-ECC)
Seville, SPAIN, DEC 12-15, 2005
Indexing
Other information
Authenticus ID: P-007-H3C
Abstract (EN): In this paper we introduce an identification algorithm for MIMO bilinear systems subject to deterministic inputs. The new algorithm is based on an expanding dimensions concept, leading to a rectangular, dimension varying, linear system. In this framework the observability, controllability, and Markov parameters are similar to those of a time-varying system. The fact that the system is time invariant, leads to an equaivaleet linear deterministic subspace algorithm. Provided a rank condition is satisfied, the algorithm will produce unbiased parameter estimates. This rank condition can be guaranteed to hold if the ratio of the number of outputs to the number of inputs is larger than the system order. This is due to the typical exponential blow-out in the dimensions of the Hankel data matrices of bilinear systems, in particular for deterministic inputs since part of the input subspace cannot be projected out. Other algorithms in the literature, based on Walsh functions, require that the number of outputs is at least equal to the system order. For ease of notation and clarification, the algorithm is presented as an intersection based subspace algorithm. Numerical results show that the algorithm reproduces the system parameters very well, provided the rank condition is satisfied. When the rank condition is not satisfied, the algorithm will return biased parameter estimates, which is a typical bottleneck of bilinear system identification algorithms for deterministic inputs. © 2005 IEEE.
Language: English
Type (Professor's evaluation): Scientific
Documents
We could not find any documents associated to the publication.
Related Publications

Of the same authors

FRONT MATTER (2011)
Another Publication in an International Scientific Journal
P. Lopes dos Santos; Perdicoúlis, TPA; Novara, C; Ramos, JA; Rivera, DE
BACK MATTER (2011)
Another Publication in an International Scientific Journal
P. Lopes dos Santos; Perdicoúlis, TPA; Novara, C; Ramos, JA; Rivera, DE
Linear Parameter-varying System Identification: New Developments And Trends (2011)
Book
P. Lopes dos Santos; Perdicoúlis, TPA; Novara, C; Ramos, JA; Rivera, DE
Linear Parameter-Varying System Identification (2011)
Book
P. Lopes dos Santos; Azevedo Perdicoúlis, TP; Novara, C; Ramos, JA; Rivera, DE
Introduction (2011)
Chapter or Part of a Book
Novara, C; P. Lopes dos Santos; Perdicoúlis, TPA; Ramos, JA; Rivera, DE

See all (27)

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-17 at 19:39:28 | Privacy Policy | Personal Data Protection Policy | Whistleblowing