Computing controlled invariant sets from data using convex optimization
From MaRDI portal
Abstract: This work presents a data-driven method for approximation of the maximum positively invariant (MPI) set and the maximum controlled invariant (MCI) set for nonlinear dynamical systems. The method only requires the knowledge of a finite collection of one-step transitions of the discrete-time dynamics, without the requirement of segments of trajectories or the control inputs that effected the transitions to be available. The approach uses a novel characterization of the MPI and MCI sets as the solution to an infinite-dimensional linear programming (LP) problem in the space of continuous functions, with the optimum being attained by a (Lipschitz) continuous function under mild assumptions. The infinite-dimensional LP is then approximated by restricting the decision variable to a finite-dimensional subspace and by imposing the non-negativity constraint of this LP only on the available data samples. This leads to a single finite-dimensional LP that can be easily solved using off-the-shelf solvers. We analyze the convergence rate and sample complexity, proving probabilistic as well as hard guarantees on the volume error of the approximations. The approach is very general, requiring minimal underlying assumptions. In particular, the dynamics is not required to be polynomial or even continuous (forgoing some of the theoretical results). Detailed numerical examples up to state-space dimension ten with code available online demonstrate the method.
Recommendations
- Convex computation of the maximum controlled invariant set for polynomial control systems
- The computation of convex invariant sets via Newton's method
- Sum-of-squares methods for controlled invariant sets with applications to model-predictive control
- Model Predictive Control – Numerical Methods for the Invariant Sets Approximation
- On the computation of convex robust control invariant sets for nonlinear systems
Cites work
- scientific article; zbMATH DE number 3810550 (Why is no real title available?)
- scientific article; zbMATH DE number 837313 (Why is no real title available?)
- scientific article; zbMATH DE number 3030854 (Why is no real title available?)
- A dual to Lyapunov's stability theorem
- A moment approach for entropy solutions to nonlinear hyperbolic PDEs
- An algorithm to find maximal state constraint sets for discrete-time linear dynamical systems with bounded controls and states
- Constrained model predictive control: Stability and optimality
- Controlled invariant feasibility - a general approach to enforcing strong feasibility in MPC applied to move-blocking
- Convex Computation of the Region of Attraction of Polynomial Control Systems
- Convex computation of the maximum controlled invariant set for polynomial control systems
- Curvature Measures
- Data driven stability analysis of black-box switched linear systems
- Extremal points and optimal control theory
- Generalized Curves and Extremal Points
- Infinite dimensional analysis. A hitchhiker's guide.
- Multivariate simultaneous approximation
- Nonlinear Control Synthesis by Convex Optimization
- Nonlinear Optimal Control via Occupation Measures and LMI-Relaxations
- Relaxation of optimal control problems to equivalent convex programs
- Semidefinite approximations of invariant measures for polynomial systems
- Set invariance in control
- Set-theoretic methods in control
- The Equivalence of Strong and Weak Formulations for Certain Problems in Optimal Control
- The Linear Programming Approach to Approximate Dynamic Programming
- The finite element methods for elliptic problems.
Cited in
(8)- Convex computation of extremal invariant measures of nonlinear dynamical systems and Markov processes
- Convex computation of the maximum controlled invariant set for polynomial control systems
- Minimal time nonlinear control via semi-infinite programming
- Auxiliary functions as Koopman observables: data-driven analysis of dynamical systems via polynomial optimization
- Sum-of-squares methods for controlled invariant sets with applications to model-predictive control
- Converging outer approximations to global attractors using semidefinite programming
- Data-driven certified control barrier functions
- Data-driven invariant set for nonlinear systems with application to command governors
This page was built for publication: Computing controlled invariant sets from data using convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5130898)
