Bounding the Distance to Unsafe Sets with Convex Optimization
arXiv:2110.14047 · doi:10.1109/TAC.2023.3285862
Abstract
This work proposes an algorithm to bound the minimum distance between points on trajectories of a dynamical system and points on an unsafe set. Prior work on certifying safety of trajectories includes barrier and density methods, which do not provide a margin of proximity to the unsafe set in terms of distance. The distance estimation problem is relaxed to a Monge-Kantorovich type optimal transport problem based on existing occupation-measure methods of peak estimation. Specialized programs may be developed for polyhedral norm distances (e.g. L1 and Linfinity) and for scenarios where a shape is traveling along trajectories (e.g. rigid body motion). The distance estimation problem will be correlatively sparse when the distance objective is separable.
arXiv comment28 pages, 16 figures
References in corpus (6)
- Lifts of convex sets and cone factorizations
- Chordal-TSSOS: a moment-SOS hierarchy that exploits term sparsity with chordal extension
- Exploiting symmetries in SDP-relaxations for polynomial optimization
- Bounding extreme events in nonlinear dynamics using convex optimization
- Convergence of Lasserre's hierarchy: the general case
- Sparse decompositions of nonlinear dynamical systems and applications to moment-sum-of-squares relaxations