Asymptotically stable data-driven koopman operator approximation with inputs using total extended DMD

Abstract The Koopman operator framework can be used to identify a data-driven model of a nonlinear system. Unfortunately, when the data is corrupted by noise, the identified model can be biased. Additionally, depending on the choice of lifting functions, the identified model can be unstable, even when the underlying system is asymptotically stable. This paper presents an approach to reduce the bias in an approximate Koopman model, and simultaneously ensure asymptotic stability, when using noisy data. Additionally, the proposed data-driven modeling approach is applicable to systems with inputs, such as a known forcing function or a control input. Specifically, bias is reduced by using a total least-squares, modified to accommodate inputs in addition to lifted inputs. To enforce asymptotic stability of the approximate Koopman model, linear matrix inequality constraints are augmented to the identification problem. The performance of the proposed method is then compared to the well-known extended dynamic mode decomposition (DMD) method and to the newly introduced forward–backward extended DMD method using a simulated Duffing oscillator dataset and experimental soft robot arm dataset.

Authors

Institutions

Publication Details

Journal
Machine Learning Science and Technology
Published
2024-12-24
DOI
https://doi.org/10.1088/2632-2153/ada33b
Citations
1
Primary Topic
Model Reduction and Neural Networks
Type
article
Field-Weighted Citation Impact
0.28

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Asymptotically stable data-driven koopman operator approximation with inputs using total extended DMD

James Richard Forbes, Louis Lortie
1 citations
Machine Learning Science and Technology
Model Reduction and Neural Networks
0.28
article

Asymptotically stable data-driven koopman operator approximation with inputs using total extended DMD

James Richard Forbes, Louis Lortie
article en
1 citations

Abstract

Abstract The Koopman operator framework can be used to identify a data-driven model of a nonlinear system. Unfortunately, when the data is corrupted by noise, the identified model can be biased. Additionally, depending on the choice of lifting functions, the identified model can be unstable, even when the underlying system is asymptotically stable. This paper presents an approach to reduce the bias in an approximate Koopman model, and simultaneously ensure asymptotic stability, when using noisy data. Additionally, the proposed data-driven modeling approach is applicable to systems with inputs, such as a known forcing function or a control input. Specifically, bias is reduced by using a total least-squares, modified to accommodate inputs in addition to lifted inputs. To enforce asymptotic stability of the approximate Koopman model, linear matrix inequality constraints are augmented to the identification problem. The performance of the proposed method is then compared to the well-known extended dynamic mode decomposition (DMD) method and to the newly introduced forward–backward extended DMD method using a simulated Duffing oscillator dataset and experimental soft robot arm dataset.

Machine Learning Science and TechnologyVol. 6(1)
McGill University (CA)
Canadian Institute for Advanced Research, Toyota Research Institute, Natural Sciences and Engineering Research Council of Canada, Fonds de recherche du Québec – Nature et technologies, Office of Naval Research Global
Openalex Percentile: Top 41%
Model Reduction and Neural Networks
0.28
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.