arXiv:2507.06605cs.RO2025-07

用AI代理生成多步探索路径,让机器人规划更快更准

Growing Trees with an Agent: Accelerating RRTs with Learned, Multi-Step Episodic Exploration

  • 用深度强化学习代理代替随机采样,生成连贯的探索路径
  • 6维机械臂场景下成功率98%、速度提升107倍、碰撞检查减少99.6%
  • 适合需要高效路径规划的机器人、自动驾驶等实际应用

传统基于采样的运动规划算法如RRT在复杂或高维空间中效率低下,因其依赖无方向的随机采样。本文提出新型混合规划框架Episodic RRT,将原始的随机点替换为由深度强化学习代理生成的多步“探索片段”。通过让DRL代理驱动探索过程,ERRT将搜索从漫无目的的体积扩展转变为有方向的枝状生长。该范式转变带来显著优势:以聚焦探索应对维度灾难,主动提出局部有效路径以减少昂贵的碰撞检测,通过生成天然连通的路径段提升连通性。在2D、3D和6D环境中的大量实验表明,ERRT及其变体在无需任何GPU加速的情况下,始终显著优于经典方法。在挑战性的6D机械臂场景中,ERRT成功率高达98%(对比RRT的19%),速度最快提升107倍,碰撞检查减少超99.6%,初始路径长度缩短近50%。其渐进最优变体ERRT*在3D环境中,解决方案优化速度比标准RRT*快29倍,展现卓越的即时性能。

原文摘要 · Abstract (English)

Classical sampling-based motion planners like the RRTs suffer from inefficiencies, particularly in cluttered or high-dimensional spaces, due to their reliance on undirected, random sampling. This paper introduces the Episodic RRT, a novel hybrid planning framework that replaces the primitive of a random point with a learned, multi-step "exploratory episode" generated by a Deep Reinforcement Learning agent. By making the DRL agent the engine of exploration, ERRT transforms the search process from a diffuse, volumetric expansion into a directed, branch-like growth. This paradigm shift yields key advantages: it counters the curse of dimensionality with focused exploration, minimizes expensive collision checks by proactively proposing locally valid paths, and improves connectivity by generating inherently connected path segments. We demonstrate through extensive empirical evaluation across 2D, 3D, and 6D environments that ERRT and its variants consistently and significantly outperform their classical counterparts without any GPU acceleration. In a challenging 6D robotic arm scenario, ERRT achieves a 98% success rate compared to 19% for RRT, is up to 107x faster, reduces collision checks by over 99.6%, and finds initial paths that are nearly 50% shorter. Furthermore, its asymptotically optimal variant, ERRT*, demonstrates vastly superior anytime performance, refining solutions to near-optimality up to 29x faster than standard RRT* in 3D environments. Code: https://xinyuwuu.github.io/Episodic_RRT/.

机器人规划强化学习路径优化

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