Subspace Algorithm for Identifying Bilinear Repetitive Processes with Deterministic Inputs

Author(s)

Jose A. Ramos, Nova Southeastern UniversityFollow
Eric Rogers
Paulo Lopes dos Santos
Teresa Paula Azevedo Perdicoulis

Document Type

Article

Publication Title

European Control Conference

Event Date/Location

Aalborg, Denmark

Publication Date

2016

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.

DOI

10.1109/ECC.2016.7810429

First Page

1057

Last Page

1062

NSUWorks Citation

Ramos, Jose A.; Rogers, Eric; Lopes dos Santos, Paulo; and Azevedo Perdicoulis, Teresa Paula, "Subspace Algorithm for Identifying Bilinear Repetitive Processes with Deterministic Inputs" (2016). CCE Faculty Articles. 440.
https://nsuworks.nova.edu/gscis_facarticles/440