arXiv:2510.09204cs.ROcs.LG2025-10

用生成模型和可微安全过滤器,实现数十机器人快速平滑轨迹规划。

Flow-Opt: Scalable Centralized Multi-Robot Trajectory Optimization with Flow Matching and Differentiable Optimization

  • 用流匹配+扩散Transformer生成候选轨迹,结合可微安全过滤器保障约束满足。
  • 支持数十机器人在复杂环境中小于百毫秒完成规划,速度比现有方法快数倍。
  • 可批量处理多个任务,生成多样避障路径,适合高密度协同场景。

多机器人集中式轨迹优化在联合空间中能探索更大可行域,提升紧致环境下的轨迹平滑性,但通常难以扩展至小规模集群之外。本文提出Flow-Opt,一种基于学习的方法以提升计算可扩展性。首先训练生成模型采样候选轨迹,再通过学习的安全滤波器(SF)实现实时约束满足。采用带排列不变编码器的扩散Transformer作为生成模型,设计专用可微求解器,并引入神经网络预测上下文相关初始化,通过自监督方式训练。实验表明:可在几十毫秒内完成数十机器人在密集环境中的轨迹生成,速度为现有集中式方法的数倍;相比基于扩散模型的基线,轨迹更平滑且速度快数个量级;各组件支持批量处理,可在极短时间内求解数十个实例,为首次实现;还可生成从起点到终点的多样化路径,体现不同避障策略。

原文摘要 · Abstract (English)

Centralized trajectory optimization in the joint space of multiple robots allows access to a larger feasible space that can result in smoother trajectories, especially while planning in tight spaces. Unfortunately, it is often computationally intractable beyond a very small swarm size. In this paper, we propose Flow-Opt, a learning-based approach towards improving the computational tractability of centralized multi-robot trajectory optimization. Specifically, we reduce the problem to first learning a generative model to sample different candidate trajectories and then using a learned Safety-Filter(SF) to ensure fast inference-time constraint satisfaction. We propose a flow-matching model with a diffusion transformer (DiT) augmented with permutation invariant robot position and map encoders as the generative model. We develop a custom solver for our SF and equip it with a neural network that predicts context-specific initialization. The initialization network is trained in a self-supervised manner, taking advantage of the differentiability of the SF solver. We advance the state-of-the-art in the following respects. First, we show that we can generate trajectories of tens of robots in cluttered environments in a few tens of milliseconds. This is several times faster than existing centralized optimization approaches. Moreover, our approach also generates smoother trajectories orders of magnitude faster than competing baselines based on diffusion models. Second, each component of our approach can be batched, allowing us to solve a few tens of problem instances in a fraction of a second. We believe this is a first such result; no existing approach provides such capabilities. Finally, our approach can generate a diverse set of trajectories between a given set of start and goal locations, which can capture different collision-avoidance behaviors.

多机器人轨迹规划生成模型可微优化

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。