Computing Controlled Invariant Sets from Data Using Convex Optimization

DOI10.1137/19M1305835zbMath1451.93159arXiv1912.03256OpenAlexW3102205276MaRDI QIDQ5130898

Milan Korda

Publication date: 29 October 2020

Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1912.03256

zbMATH Keywords

samplingconvex optimizationdatainfinite-dimensional linear programmingmaximum controlled invariant setmaximum positively invariant set

Mathematics Subject Classification ID

Convex programming (90C25) Linear programming (90C05) Nonlinear systems in control theory (93C10)

Related Items (3)

Converging outer approximations to global attractors using semidefinite programming ⋮ Auxiliary functions as Koopman observables: data-driven analysis of dynamical systems via polynomial optimization ⋮ Convex computation of extremal invariant measures of nonlinear dynamical systems and Markov processes

Uses Software

• YALMIP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Controlled invariant feasibility - a general approach to enforcing strong feasibility in MPC applied to move-blocking
• Relaxation of optimal control problems to equivalent convex programs
• Extremal points and optimal control theory
• Set invariance in control
• Multivariate simultaneous approximation
• Constrained model predictive control: Stability and optimality
• A moment approach for entropy solutions to nonlinear hyperbolic PDEs
• Data driven stability analysis of black-box switched linear systems
• Semidefinite approximations of invariant measures for polynomial systems
• Convex Computation of the Region of Attraction of Polynomial Control Systems
• Curvature Measures
• The Linear Programming Approach to Approximate Dynamic Programming
• Generalized Curves and Extremal Points
• The Equivalence of Strong and Weak Formulations for Certain Problems in Optimal Control
• An algorithm to find maximal state constraint sets for discrete-time linear dynamical systems with bounded controls and states
• Convex Computation of the Maximum Controlled Invariant Set For Polynomial Control Systems
• Nonlinear Control Synthesis by Convex Optimization
• Nonlinear Optimal Control via Occupation Measures and LMI-Relaxations
• Set-theoretic methods in control
• A dual to Lyapunov's stability theorem

This page was built for publication: Computing Controlled Invariant Sets from Data Using Convex Optimization