arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2603.09458cs.RO
收藏

Stein变分遍历曲面覆盖与SE(3)约束

Stein Variational Ergodic Surface Coverage with SE(3) Constraints

Department of Computer Science, TU Darmstadt(图宾根大学计算机科学系);Honda Research Institute Europe GmbH(本田欧洲研究院);University of California, Berkeley(加州大学伯克利分校)

Jiayun Li, Yufeng Jin, Sangli Teng, Dejian Gong, Georgia Chalvatzaki

AI总结:

提出一种基于预条件SE(3) Stein变分梯度下降的采样即优化方法,用于生成满足SE(3)约束的遍历轨迹,实现复杂3D点云曲面的高质量覆盖。

摘要:

曲面操作任务要求机器人生成能够全面覆盖复杂3D曲面同时保持精确末端执行器姿态的轨迹。现有的遍历轨迹优化(TO)方法在覆盖任务中表现出色,但由于非凸优化景观以及采样即优化(SAO)技术中对SE(3)约束处理不足,在处理点云目标时存在困难。在这项工作中,我们引入了一种预条件SE(3) Stein变分梯度下降(SVGD)方法用于SAO遍历轨迹生成。我们提出的方法包含多项创新。首先,我们将点云遍历覆盖重新表述为流形感知的采样问题。其次,我们推导了SE(3)特定的SVGD粒子更新,第三,我们开发了一个预条件子以加速TO收敛。与基于优化的强基线和SAO基线相比,我们的基于采样的框架在保持SE(3)几何结构的同时,一致地识别出更优的局部最优解。在3D点云曲面覆盖基准测试和机器人曲面绘制任务上的实验表明,相对于现有的TO和SAO方法,我们的方法在我们的设置中以可计算的计算量实现了更优的覆盖质量,并在真实机器人实验中得到了验证。

英文摘要:

Surface manipulation tasks require robots to generate trajectories that comprehensively cover complex 3D surfaces while maintaining precise end-effector poses. Existing ergodic trajectory optimization (TO) methods demonstrate success in coverage tasks, while struggling with point-cloud targets due to the nonconvex optimization landscapes and the inadequate handling of SE(3) constraints in sampling-as-optimization (SAO) techniques. In this work, we introduce a preconditioned SE(3) Stein Variational Gradient Descent (SVGD) approach for SAO ergodic trajectory generation. Our proposed approach comprises multiple innovations. First, we reformulate point-cloud ergodic coverage as a manifold-aware sampling problem. Second, we derive SE(3)-specific SVGD particle updates, and, third, we develop a preconditioner to accelerate TO convergence. Our sampling-based framework consistently identifies superior local optima compared to strong optimization-based and SAO baselines while preserving the SE(3) geometric structure. Experiments on a 3D point-cloud surface coverage benchmark and robotic surface drawing tasks demonstrate that our method achieves superior coverage quality with tractable computation in our setting relative to existing TO and SAO approaches, and is validated in real-world robot experiments.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑