Data-driven system analysis of nonlinear systems using polynomial approximation
Tim Martin, Frank Allg\"ower

TL;DR
This paper introduces a data-driven polynomial approximation framework for nonlinear systems that provides rigorous guarantees and is computationally tractable, improving system analysis and control design.
Contribution
It develops a polynomial sector representation using Taylor's theorem and set-membership from noisy data, enabling verified dissipativity analysis with sum of squares relaxation.
Findings
Effective polynomial approximation from noisy data
Rigorous guarantees for dissipativity verification
Comparison shows advantages over least-squares models
Abstract
In the context of data-driven control of nonlinear systems, many approaches lack of rigorous guarantees, call for nonconvex optimization, or require knowledge of a function basis containing the system dynamics. To tackle these drawbacks, we establish a polynomial representation of nonlinear functions based on a polynomial sector by Taylor's theorem and a set-membership for Taylor polynomials. The latter is obtained from finite noisy samples. By incorporating the measurement noise, the error of polynomial approximation, and potentially given prior knowledge on the structure of the system dynamics, we achieve computationally tractable conditions by sum of squares relaxation to verify dissipativity and incremental dissipativity of nonlinear dynamical systems with rigorous guarantees. The framework is extended by combining multiple Taylor polynomial approximations which yields a less…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsControl Systems and Identification · Model Reduction and Neural Networks · Advanced Control Systems Optimization
