Reachable set computation of linear systems with nonconvex constraints via convex optimization

DOI10.1016/j.automatica.2022.110632zbMath1505.93021OpenAlexW4303983762MaRDI QIDQ2097796

Run-Qiu Yang, Xinfu Liu

Publication date: 14 November 2022

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.automatica.2022.110632

zbMATH Keywords

convexificationlinear time-varying systemreachable setnonconvex control constraint

Mathematics Subject Classification ID

Convex programming (90C25) Linear systems in control theory (93C05) Attainable sets, reachability (93B03)

Uses Software

• ECOS

Cites Work

• Unnamed Item
• Unnamed Item
• Approximation of reachable sets using optimal control algorithms
• Maximum divert for planetary landing using convex optimization
• Applied functional analysis. Functional analysis, Sobolev spaces and elliptic differential equations
• On implementing a primal-dual interior-point method for conic quadratic optimization
• On reachability and minimum cost optimal control
• Analysis on reachable set for spacecraft relative motion under low-thrust
• The existence of optimal controls in the absence of convexity conditions
• Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
• Under-Approximating Reach Sets for Polynomial Continuous Systems
• Backward Reachability for Polynomial Systems on a Finite Horizon
• A time-dependent Hamilton-Jacobi formulation of reachable sets for continuous dynamic games
• Reachability Analysis of Discrete-Time Systems With Disturbances
• Approximation of reachable sets by direct solution methods for optimal control problems
• Reachable sets for linear dynamical systems
• Dynamic optimization for reachability problems.

This page was built for publication: Reachable set computation of linear systems with nonconvex constraints via convex optimization