Inner approximations of the maximal positively invariant set for polynomial dynamical systems
Antoine Oustry (LIX), Matteo Tacchi (LAAS-MAC), Didier Henrion, (LAAS-MAC)

TL;DR
This paper introduces a method using the Lasserre hierarchy to compute inner approximations of the maximal positively invariant set for polynomial dynamical systems, with proven convergence in volume under certain conditions.
Contribution
It extends previous work by focusing on inner approximations in infinite time, providing volume convergence guarantees unlike prior methods.
Findings
Proves convergence in volume of the hierarchy under growth conditions.
Develops a method for inner approximations in infinite time.
Addresses limitations of previous outer and finite-time inner approximation methods.
Abstract
The Lasserre or moment-sum-of-square hierarchy of linear matrix inequality relaxations is used to compute inner approximations of the maximal positively invariant set for continuous-time dynamical systems with polynomial vector fields. Convergence in volume of the hierarchy is proved under a technical growth condition on the average exit time of trajectories. Our contribution is to deal with inner approximations in infinite time, while former work with volume convergence guarantees proposed either outer approximations of the maximal positively invariant set or inner approximations of the region of attraction in finite time.
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
TopicsStability and Control of Uncertain Systems · Advanced Differential Equations and Dynamical Systems · Advanced Optimization Algorithms Research
