用改进的粒子采样法生成精准覆盖3D表面的机器人轨迹
Stein Variational Ergodic Surface Coverage with SE(3) Constraints
- 将点云覆盖转为流形感知采样问题,提升优化稳定性
- 设计专用SE(3)更新规则与预条件器,加速收敛并保持姿态精度
- 实测在复杂曲面覆盖任务中效果优于现有方法,适合真实机器人应用
表面操作任务要求机器人生成全面覆盖复杂三维表面的轨迹,同时保持末端执行器精确位姿。现有熵性轨迹优化(TO)方法在覆盖任务中表现良好,但在点云目标上因非凸优化景观和采样-优化(SAO)技术对SE(3)约束处理不足而受限。本文提出一种带预条件的SE(3) Stein变分梯度下降(SVGD)方法用于SAO熵性轨迹生成。该方法包含三项创新:首先,将点云熵性覆盖重构为流形感知采样问题;其次,推导出针对SE(3)的SVGD粒子更新规则;第三,设计预条件器以加速TO收敛。基于采样的框架在多个局部最优解中表现更优,同时保持了SE(3)几何结构。在3D点云表面覆盖基准和机器人绘图任务上的实验表明,该方法在可接受计算开销下实现了更高覆盖率,优于现有TO与SAO方法,并在真实机器人实验中得到验证。
原文摘要 · Abstract (English)
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.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。