提出可解析求解的路径生成模型,实现精确可控的轨迹设计。
Analytic Bridge Diffusions for Controlled Path Generation

- 基于线性二次高斯框架,将路径生成转化为可解析计算的矩阵微分问题。
- 在2D走廊与多入口任务中成功生成指定轨迹,高维场景达d=32、M=16模式。
- 提供明确解析解,可用于测试评分近似与路径控制方法的可靠性。
现有桥式扩散方法通过设定插值、薛定谔桥或随机控制目标,并用神经网络学习对应得分或漂移场来实现有限时间传输。本文识别出一类受限但足够广泛的可解析求解类:当源为确定性且目标为高斯混合分布时,得分函数与所有中间边缘分布均可显式表达,且无需内层随机模拟即可对协议目标进行微分。我们将经典的线性-二次-高斯(LQG)随机控制结构重新表述为路径积分扩散型传输问题。在线性动力学、高斯噪声和二次运行成本下,桥接计算简化为矩阵里卡蒂级联;终端状态成本由预设的高斯混合终端概率密度替代。由此提出的线性二次-高斯混合-路径积分扩散(LQ-GM-PID)将桥接扩散从单纯的终点匹配扩展为可解析控制的路径形状设计实验室。我们在二维走廊任务、二维多入口任务及高维研究(维度d=32,终端模式数M=16)中验证了该方法的有效性。将LQ-GM-PID定位为一个可解析求解的参考模型,可用于对比评分近似、路径控制目标与协议学习方法的性能。
原文摘要 · Abstract (English)
Most modern bridge-diffusion methods achieve finite-time transport by specifying an interpolation, Schrodinger-bridge, or stochastic-control objective and then learning the associated score or drift field with a neural network. In contrast, we identify a restricted but sufficiently broad analytically solvable class in which, for a deterministic source and a Gaussian-mixture target, the score and all intermediate marginals are explicit and protocol objectives of the type used in this paper can be differentiated without inner stochastic simulation loops. We recast the classical linear--quadratic--Gaussian stochastic-control structure as a transport problem of the Path Integral Diffusion type. Linear dynamics, Gaussian noise, and quadratic running costs reduce the bridge calculation to a matrix Riccati cascade, while the terminal state cost is replaced by a prescribed Gaussian-Mixture terminal probability density. Linear Quadratic -- Gaussian Mixture -- Path Integral Diffusion (LQ-GM-PID) thereby turns bridge diffusion from terminal target matching alone into an analytically controlled laboratory for path shaping. We demonstrate this on a 2D corridor task, a 2D multi-entrance task, and a high-dimensional study reaching d=32 and M=16 terminal modes in separate scaling sweeps. We position LQ-GM-PID as an analytically solvable reference model in which score approximations, path-shaping objectives, and protocol-learning procedures can be tested against explicit quantities.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。