用李群约束的快速生成抓取方法,5次网络评估内完成毫秒级抓取生成。
Fast Generative Grasping via Lie Group-Constrained MeanFlow

- 在李群上构建均值流模型,联合代数一致性与黎曼条件流匹配训练。
- 仅需≤5次网络评估即可生成可靠抓取,推理速度比顶尖模型快39倍。
- 无需额外训练即可实现实体机器人抓取,抗观测噪声能力强。
抓取合成是机器人操作的核心任务,其解通常形成多模态分布而非单一估计。生成式机器人抓取旨在通过扩散模型和基于流的方法学习该分布。这类生成模型的迭代特性使其具备灵活性与泛化性,但多步采样阻碍了机器人对时效性的要求。本文提出基于李群乘积 $\ ext{SO}(3) \times \bR^3$ 上均值流的快速生成抓取方法。训练目标结合纯代数半群一致性条件与黎曼条件流匹配,将平均速度锚定于数据分布。所提出的李群约束均值流可在 ≤5 次网络评估内生成可靠抓取,在 ACRONYM 数据集上性能媲美最先进扩散与流模型,且推理延迟达毫秒级(最高提速 39 倍)。进一步实验表明,该方法无需额外训练或领域适配,即可直接应用于真实机器人抓取,在观测噪声下仍具鲁棒性。
原文摘要 · Abstract (English)
Grasp synthesis is a core task in robotic manipulation, for which the solution typically forms a multimodal distribution rather than a point estimate. Generative robotic grasping aims to learn this distribution with deep generative models such as diffusion and flow-based approaches. The iterative nature of such generative models makes them flexible and generalizable; however, multi-step sampling impedes the time-critical operation required in robotics. We devise an approach to fast generative grasping based on MeanFlow on the product Lie group $\mathcal{G} = \mathrm{SO}(3) \times \mathbb{R}^3$. The training objective couples a purely algebraic semigroup consistency condition with Riemannian Conditional Flow Matching on $\mathcal{G}$ that anchors the average velocity to the data distribution. The resulting Lie Group-constrained MeanFlow formulation samples reliable grasps in $\leq 5$ network evaluations, matching the grasp generation performance of state-of-the-art diffusion and flow-based models on the ACRONYM dataset at millisecond-scale inference latency (up to $39\times$ speed-up). We further demonstrate that the approach directly translates to real-world robotic grasping without additional training or domain adaptation, exhibiting robust grasp synthesis under observation noise.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。