Abstract
In this paper we introduce a bilinear repetitive process and present an iterative subspace algorithm for its identification. The advantage of the proposed approach is that it overcomes the “curse of dimensionality”, a hurdle commonly encountered with classical bilinear subspace identification algorithms. Simulation results show that the algorithm converges quickly and provides new alternatives for modeling/identifying nonlinear repetitive processes.
| Original language | American English |
|---|---|
| Pages | 1057-1062 |
| Number of pages | 6 |
| DOIs | |
| State | Published - Jun 1 2016 |
| Event | European Control Conference - Aalborg, Denmark Duration: Jun 29 2016 → Jul 1 2016 https://ieeexplore.ieee.org/xpl/conhome/7792520/proceeding |
Conference
| Conference | European Control Conference |
|---|---|
| Country/Territory | Denmark |
| City | Aalborg |
| Period | 6/29/16 → 7/1/16 |
| Internet address |
Bibliographical note
Publisher Copyright:© 2016 EUCA.
ASJC Scopus Subject Areas
- Control and Systems Engineering
- Control and Optimization
Disciplines
- Computer Sciences
Fingerprint
Dive into the research topics of 'Subspace Algorithm for Identifying Bilinear Repetitive Processes with Deterministic Inputs'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS