arXiv · 2611.21036
Non-Myopic Safety Filtering with Learned Intervention Cost-to-Go
Abstract
Control barrier function (CBF) safety filters minimize instantaneous deviation from a nominal control command, but a sequence of pointwise-minimal interventions need not minimize cumulative intervention effort. This paper proposes a discrete-time non-myopic safety filter using a learned approximation of the optimal intervention cost-to-go over CBF-admissible policies. The approximation enters through a relaxed Bellman-residual constraint, while the original barrier condition remains hard. Feasibility is equivalent to that of the conventional CBF filter, and forward invariance remains independent of approximation accuracy under the stated assumptions. We derive a trajectory-wise performance certificate that requires neither the optimal value function nor an approximation-error bound. Under additional approximation and horizon assumptions, a suboptimality bound contains an explicit endpoint approximation-error term together with accumulated tolerance and relaxation terms. Numerical results for a collision-avoidance problem show an approximately 50% reduction in mean cumulative intervention effort relative to conventional CBF filtering over 100 initial conditions not used during training or parameter selection. The improvement is consistent across three independently trained networks, while maintaining the prescribed safety constraints and requiring less online computation than the tested predictive filter.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Johannes Autenrieb, Mark Spiller, Daniel Silvestre, Namhoon Cho, Jason J. Choi. 2026-11-16. Non-Myopic Safety Filtering with Learned Intervention Cost-to-Go. https://searcharxiv.com/abs/2611.21036
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.