arXiv Analytics

Sign in

arXiv:2303.17674 [math.OC]AbstractReferencesReviewsResources

Exact Characterization of the Convex Hulls of Reachable Sets

Thomas Lew, Riccardo Bonalli, Marco Pavone

Published 2023-03-30Version 1

We study the convex hulls of reachable sets of nonlinear systems with bounded disturbances. Reachable sets play a critical role in control, but remain notoriously challenging to compute, and existing over-approximation tools tend to be conservative or computationally expensive. In this work, we exactly characterize the convex hulls of reachable sets as the convex hulls of solutions of an ordinary differential equation from all possible initial values of the disturbances. This finite-dimensional characterization unlocks a tight estimation algorithm to over-approximate reachable sets that is significantly faster and more accurate than existing methods. We present applications to neural feedback loop analysis and robust model predictive control.

Related articles: Most relevant | Search more
arXiv:2004.00424 [math.OC] (Published 2020-03-29)
Solving the inverse problem for an ordinary differential equation using conjugation
Alfaro Vigo et al.
arXiv:1412.3302 [math.OC] (Published 2014-12-09)
Approximation of reachable sets using optimal control and support vector machines
arXiv:1909.07492 [math.OC] (Published 2019-09-16)
On-line Non-Convex Constrained Optimization