arXiv:2504.10783cs.ROcs.CG2025-04被引 21

用GPU实时生成机器人避障凸集,提升规划速度与可靠性

Superfast Configuration-Space Convex Set Computation on GPUs for Online Motion Planning

  • 通过并行计算将路径膨胀为概率无碰撞的凸集序列
  • 比非线性优化基线快17.1倍,可靠性提升27.9%
  • 适合动态环境下的实时运动规划,如机械臂感知闭环

本文利用GPU在机器人配置空间中在线构建概率无碰撞的凸集。该方法扩展了依赖此类表示的现代运动规划算法在动态环境中的应用。这些规划器能快速可靠地优化高质量轨迹,无需处理复杂的非凸避障约束。我们提出一种算法,利用大规模并行性将无碰撞分段线性路径膨胀为概率无碰撞的凸集序列(SCS)。随后将其集成到运动规划流水线中,结合动态路网快速寻找一条或多条无碰撞路径并进行膨胀。接着通过候选轨迹同时优化路径,并检测并移除凸集中的碰撞。我们在仿真基准和带有感知闭环的KUKA iiwa 7机械臂上验证了方法的有效性。在基准测试中,本方法比非线性轨迹优化基线快17.1倍,可靠性提升27.9%,同时生成高质量运动规划结果。

原文摘要 · Abstract (English)

In this work, we leverage GPUs to construct probabilistically collision-free convex sets in robot configuration space on the fly. This extends the use of modern motion planning algorithms that leverage such representations to changing environments. These planners rapidly and reliably optimize high-quality trajectories, without the burden of challenging nonconvex collision-avoidance constraints. We present an algorithm that inflates collision-free piecewise linear paths into sequences of convex sets (SCS) that are probabilistically collision-free using massive parallelism. We then integrate this algorithm into a motion planning pipeline, which leverages dynamic roadmaps to rapidly find one or multiple collision-free paths, and inflates them. We then optimize the trajectory through the probabilistically collision-free sets, simultaneously using the candidate trajectory to detect and remove collisions from the sets. We demonstrate the efficacy of our approach on a simulation benchmark and a KUKA iiwa 7 robot manipulator with perception in the loop. On our benchmark, our approach runs 17.1 times faster and yields a 27.9% increase in reliability over the nonlinear trajectory optimization baseline, while still producing high-quality motion plans.

运动规划GPU加速凸集实时系统

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