Daily Arxiv

This page organizes papers related to artificial intelligence published around the world.
This page is summarized using Google Gemini and is operated on a non-profit basis.
The copyright of the paper belongs to the author and the relevant institution. When sharing, simply cite the source.

SafeFlowMatcher: Safe and Fast Planning using Flow Matching with Control Barrier Functions

Created by
  • Haebom

Author

Jeongyong Yang, Seunghwan Jang, SooJean Han

Outline

Generative planners based on flow matching (FM) can generate high-quality paths in one or two ODE steps, but their sampling dynamics do not provide formal safety guarantees and can generate incomplete paths near constraints. In this paper, we present SafeFlowMatcher, a planning framework that combines FM and control barrier functions (CBFs) to achieve both real-time efficiency and certified safety. SafeFlowMatcher uses a two-step prediction-correction (PC) integrator. (i) The prediction step integrates the learned FM once (or several steps) to obtain candidate paths without intervention. (ii) The correction step refines these paths using a vanishing time-scale vector field and a CBF-based quadratic programming method that minimally perturbs the vector field. We prove a barrier certificate for the resulting flow system, establishing forward invariance of a robust safety set and finite-time convergence to the safety set. SafeFlowMatcher avoids distributional drift and mitigates the local trap problem by enforcing safety only on executed paths (rather than on all intermediate potential paths). In maze navigation and locomotion benchmarks, SafeFlowMatcher achieves faster, smoother, and safer paths than diffusion- and FM-based baselines. Extensive removal experiments support the contributions of the PC integrator and barrier certificate.

Takeaways, Limitations

Addressing the safety issue of FM-based generative planners
Achieving both real-time efficiency and certified safety
Ensure safety by using a PC integrator
Mitigates distribution drift and local trap issues by applying safety only to executed paths.
Outperforms in maze navigation and locomotion benchmarks
Limitations is not specified in the paper.
👍