Papers

AegisFlow 提出非短视路径安全引导框架

AegisFlow: Training-Free Non-Myopic Path-Safe Guided Flow Matching

Why we picked it

做流匹配或扩散引导的可以看看,这篇把约束生成转成最优控制问题,代码已开源,图像编辑和机器人规划实验都跑通了。

AegisFlow 是一种无需训练的流匹配引导方法,把受约束的生成过程转化为全局范围的安全最优控制问题。它将时变障碍函数直接写入全局代价函数,并通过对 Hamilton-Jacobi-Bellman(HJB)方程的可计算近似求全局最优控制。相比依赖 min-norm 控制器的短视方法,AegisFlow 能避免生成轨迹贴近约束边界。论文在文本引导图像编辑和机器人规划两类任务上验证,均超过现有方法,代码已在 GitHub 开源。

Original · arXiv cs.AI

AegisFlow: Training-Free Non-Myopic Path-Safe Guided Flow Matching

Pretrained generative models, such as diffusion and flow matching models, have demonstrated exceptional capabilities in synthesizing high-quality data. However, steering their generative trajectories to satisfy strict constraints--such as identity preservation in image editing or obstacle avoidance in robotics--remains fundamentally challenging. While recent training-free guidance methods enforce path-safety, they rely heavily on min-norm controllers that only account for immediate constraint satisfaction. These myopic approaches often yield suboptimal trajectories that hover dangerously close to the boundary, severely restricting the model's ability to optimize toward its target. In this paper, we propose AegisFlow, a training-free, non-myopic path-safe guidance framework that recasts guided generation as a safety-critical optimal control problem with global scope. By integrating a time-varying barrier function directly into the global cost functional, AegisFlow naturally enforces constraints along the entire generative path. To compute the global optimal control, we derive a tractable, mathematically grounded approximation of the Hamilton-Jacobi-Bellman (HJB) equation. Comprehensive experiments demonstrate that AegisFlow outperforms state-of-the-art methods across text-guided image manipulation and robotic planning, establishing a significantly better trade-off between target alignment and constraint satisfaction. Code is available at https://github.com/LiuKunpeng03/AegisFlow.