TL;DR
This paper introduces an SOS-based optimization framework for safe, real-time motion planning with model mismatch, providing guarantees of dynamic feasibility for high-dimensional systems by offline computation of tracking bounds.
Contribution
It develops a bilinear SOS optimization method to compute feedback tracking controllers and safety bounds, enabling scalable, safe planning for complex systems beyond traditional HJ analysis.
Findings
SOS approach improves scalability of safety guarantees
Trade-off between computational efficiency and conservativeness analyzed
Framework successfully applied to high-dimensional systems
Abstract
In the pursuit of real-time motion planning, a commonly adopted practice is to compute a trajectory by running a planning algorithm on a simplified, low-dimensional dynamical model, and then employ a feedback tracking controller that tracks such a trajectory by accounting for the full, high-dimensional system dynamics. While this strategy of planning with model mismatch generally yields fast computation times, there are no guarantees of dynamic feasibility, which hampers application to safety-critical systems. Building upon recent work that addressed this problem through the lens of Hamilton-Jacobi (HJ) reachability, we devise an algorithmic framework whereby one computes, offline, for a pair of "planner" (i.e., low-dimensional) and "tracking" (i.e., high-dimensional) models, a feedback tracking controller and associated tracking bound. This bound is then used as a safety margin when…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
