OpenAlex ·

Exact-Safe MPPI: Safety-Aware Sampling with Nonsmooth Control Barrier Functions

Alexander Coker and Leilei Cui

Published
Source
OpenAlex
Published in
arXiv (Cornell University)
DOI
10.48550/arxiv.2610.07369
Original
Read it at the publisher
Topics
Computational ComplexitySystems & Control

Abstract

Model predictive path integral (MPPI) control plans actions by sampling and evaluating trajectories, but standard MPPI does not guarantee safety. Incorporating control barrier function (CBF) filters into each rollout allows the planner to account for safety corrections. However, combining multiple CBFs through a soft-minimum approximation can exclude states that satisfy the original safety constraints, restricting the trajectories available to the planner. This paper proposes Exact-Safe MPPI, which uses the exact minimum of multiple barrier functions and applies a CBF-based quadratic program during both planning and control execution. To handle nondifferentiability where multiple barriers attain the minimum, the filter simultaneously enforces the CBF conditions for all $δ$-active barriers, whose values lie within a prescribed tolerance $δ>0$ of the minimum. Under suitable feasibility and regularity assumptions, we establish forward invariance of the certified safe set without the shrinkage introduced by soft-minimum smoothing. We also characterize the state-dependent approximation gap and explain how multiple barriers with values at or near the minimum increase this shrinkage. Furthermore, we show that increasing the number of MPPI samples cannot recover trajectories excluded by the soft-minimum filter. We demonstrate the effectiveness of the proposed approach in a navigation task requiring passage through a narrow gap between two obstacles. Video demonstrations are available at https://github.com/lc-lab25/Exact-Safe-MPPI .

The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.

Read it on ReadSearch

Each opens after you create an account, and brings you back to this paper.

Already a reader? Sign in

All new papers in Computational Complexity

Get the few papers worth your time in Computational Complexity every morning.

ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.

Papers belong to their authors and publishers; every page here links to the original. All research topics