Koopman Observability of Nonlinear Systems and Data-Driven Koopman--Luenberger Observer
summary
The gist
While nonlinear systems can be generally described as infinite-dimensional linear systems via their Koopman semigroups…
In short
The paper addresses how to build state observers for nonlinear systems using Koopman theory, which treats them as infinite-dimensional linear systems. It proposes a data-driven method to synthesize a Koopman–Luenberger observer by solving an operator Lyapunov inequality, achieving better performance than traditional linear or neural network observers.
Key concepts
- Koopman Semigroup
- This concept describes how the dynamics of a nonlinear system can be represented as an infinite-dimensional linear system. It involves mapping the original nonlinear state space onto a function space where the evolution is governed by a linear operator, allowing for analysis using standard linear system techniques.
- Koopman Observability and Detectability
- These are criteria used to determine if it is possible to reconstruct the state of a nonlinear system from its observed outputs. The paper defines these concepts within a specific function space (RKHS) and provides conditions for synthesizing an infinite-dimensional observer gain.
- Operator Lyapunov Inequality
- This is the core mathematical tool used to synthesize the observer gain. By solving this inequality, which is approximated using data trajectories, one can derive a finite-order observer that ensures the state estimation error converges to zero asymptotically.
- Koopman–Luenberger Observer vs. KKL
- The Koopman–Luenberger observer uses LTI dynamics for retrieval in the infinite-dimensional space, making the state recovery linear. This contrasts with KKL, which requires a nonlinear mapping for state retrieval and involves solving a nonlinear pseudoinverse, whereas the Koopman approach is framed as a convex optimization problem.
Terminology used across episodes
This episode discusses
- Koopman Observability of Nonlinear Systems and Data-Driven Koopman--Luenberger Observer · Paper Radio
- Unifying HJB and Riccati equations: A Koopman operator approach to nonlinear optimal control
- LMI Properties and Applications in Systems, Stability, and Control Theory
- Two Roads to Koopman Operator Theory for Control: Infinite Input Sequences and Operator Families
- A Dual Koopman Approach to Observer Design for Nonlinear Systems
- Koopman Modeling and Stabilization of Discrete-Time Nonlinear Control Systems: Bilinearity on a Reproducing Kernel Hilbert Space
- Data-Driven State Observers for Measure-Preserving Systems
- Data-Driven Domain of Attraction Estimation via Convergent Koopman-Zubov Approximation
- Koopman--Nemytskii Operator of Nonlinear Controlled Systems and Its Learning for Controller Synthesis
- Koopman-based Estimation of Lyapunov Functions: Theory on a Reproducing Kernel Hilbert Space
- EDMD-Based Robust Observer Synthesis for Nonlinear Systems
The paper
Koopman Observability of Nonlinear Systems and Data-Driven Koopman--Luenberger Observer · Read on arXiv
WENTAO TANG
North Carolina State University
While nonlinear systems can be generally described as infinite-dimensional linear systems via their Koopman semigroups, the direct synthesis of state observers on the premise of learned Koopman operator models, in an analogous manner to finite-dimensional linear systems, remains an open problem. In this paper, the concepts of Koopman observability, Koopman detectability, and Koopman--Luenberger observer of nonlinear systems are provided. By defining the Koopman semigroup on a reproducing kernel Hilbert space (RKHS), the conditions for Koopman exponential detectability are established, which involves solving an operator Lyapunov inequality that only implicitly involves the infinitesimal generator of the Koopman semigroup. Through the use of a finite-horizon Yosida approximation of the Koopman generator and an empirical sampling operator, the data-driven solution of the observer gain can be reduced to a finite-dimensional subspace specified by the sample and hence fulfilled by convex semidefinite programming (SDP). The state observation error is guaranteed to be bounded in a mean-squares sense, under closed-loop dissipation conditions on the sampling operator and its empirical operator.
Transcript
Introduction to the show: ident: Mathematics. The day in mathematics: new theorems, new proofs, and what they open.
Ada: We're looking at the paper: "Koopman Observability of Nonlinear Systems and Data-Driven Koopman--Luenberger Observer".
Paper summary: Ada: So we're looking at this paper, "Koopman Observability of Nonlinear Systems and Data-Driven Koopman--Luenberger Observer." It tackles the idea that nonlinear systems can actually be treated like infinite-dimensional linear systems through something called Koopman semigroups. This paper is saying that while you can describe these things as infinite-dimensional linear systems, creating state observers using learned Koopman models in a way similar to finite-dimensional linear systems is still a tough problem.
Emmy: It claims they provide concepts for both Koopman observability and detectability and also a data-driven method for synthesizing this specific kind of observer, which is the Koopman–Luenberger observer for continuous-time autonomous nonlinear systems. It sets up the framework by defining the Koopman semigroup on a reproducing kernel Hilbert space, or RKHS, which are these function spaces where they talk about strong continuity of the semigroup.
Kolya: So what does that mean in practice? They establish conditions for Koopman exponential detectability by setting up an operator Lyapunov inequality. The core idea is that this inequality only implicitly involves the infinitesimal generator of the Koopman semigroup, which is the stuff that describes how things evolve in infinite dimensions.
Ada: And then they take a finite-horizon Yosida approximation of that Koopman generator and use an empirical sampling operator to solve for the observer gain. This data-driven solution is reduced to a finite-dimensional subspace defined by the sample, which means it can be handled by convex semidefinite programming.
Emmy: It’s interesting because they show that even with this infinite-dimensional setup, when you use a finite order observer based on the solution of that empirical Lyapunov inequality, the state observation error actually converges to zero asymptotically.
Kolya: That convergence is important for us because it suggests a way to make these observers work reliably in real scenarios where we don't know the exact underlying dynamics beforehand. The question for me is what kind of data would be needed to make that empirical sampling operator estimation accurate enough.
Conclusion: Ada: Looking at this paper, "Koopman Observability of Nonlinear Systems and Data-Driven Koopman--Luenberger Observer," the authors are providing concrete concepts for observability and detectability within the Koopman framework for nonlinear systems. The main thing they claim is that by defining things on an RKHS, they can establish conditions for exponential detectability by solving an operator Lyapunov inequality.
Emmy: And then they use a finite-horizon Yosida approximation to solve this inequality data-driven, reducing the problem to convex semidefinite programming based on sample data. They also contrast their Koopman–Luenberger observer with other types, noting that while both use linear dynamics, the retrieval of state from the infinite-dimensional space in the Koopman version is completely linear.
Kolya: For me, what this means is that they're offering a pathway to synthesize these observers without having to estimate every single Koopman eigenfunction explicitly. The method relies on estimating just enough of the generator through data trajectories to get a finite-dimensional subspace for the observer gain.
Ada: It implies that instead of getting stuck with cumbersome nonlinear pseudoinverse mappings, which some other methods require, this approach boils down to a convex optimization problem when synthesizing the observer gain. That's a significant structural difference in how they handle the synthesis.
Emmy: The authors show performance against linear model-based, nonlinear model-based, and neural network observers across three different system types: asymptotically stable, limit cycle, and chaotic systems. Their results suggest this Koopman–Luenberger observer achieves better performance in these examples than those other methods tested.
Kolya: It’s good to see that empirical data can drive a solution that actually performs better than purely model-based approaches when dealing with complex dynamics like limit cycles or chaos. But we have to remember the paper states their limitation: the synthesis relies on approximating the Koopman generator using a finite-horizon Yosida form, and they need an empirical sampling operator based on data trajectories to estimate that generator.
Ada: So, while it offers a practical, data-driven way to synthesize these observers for continuous-time autonomous nonlinear systems, the success of their method hinges on how well that approximation captures the true dynamics of the system. That's what we need to keep an eye on for future work.
More episodes
- 2509.05860-Concentration Inequalities for Branching Random Walks
- 2509.19309-Small Prime Primitive Roots in Arithmetic Progressions
- 2509.21830-Noncollapsing for Curvature Flows with Inhomogeneous Speeds
- 2510.08346-Separability and Submetrizability in Locally Convex Spaces
- 2510.27290-Borel Combinatorics of Schreier Graphs of Z-actions
- 2511.13500-Sampling Density for Gabor Phase Retrieval
- 2511.19161-Linear dynamics of random products of weighted shifts
- 2511.21548-Metastability of diffusion processes in narrow tubes
- 2512.01536-Abelian approximations for bicrossed products
- 2601.02524-Lagrangian slice disks with symplectomorphic exteriors