用贝叶斯优化在可达速度窗口内高效规划机器人路径
BOW: Bayesian Optimization over Windows for Motion Planning in Complex Environments
- 以可达速度窗口为优化范围,结合约束贝叶斯优化采样控制输入
- 相比现有方法,计算时间、轨迹长度和求解时间均有显著缩短
- 适合需要快速安全规划的复杂环境机器人应用
本文提出BOW Planner,一种基于约束贝叶斯优化(CBO)的可扩展运动规划算法,用于在复杂环境中导航机器人。与传统方法不同,该算法聚焦于可达速度窗口,通过CBO高效采样控制输入,有效处理速度和加速度等动力学约束。该方法能在高维目标函数和严格安全约束下实现极低采样次数,保障轨迹生成的快速与安全。理论分析表明算法渐近收敛至近优解。在密集障碍物和强约束场景中的大量实验显示,其在计算时间、轨迹长度和求解时间上均显著优于现有技术。已在多种真实机器人系统中成功部署,展现出卓越的样本效率、安全感知优化能力和快速规划性能。BOW Planner已开源,真实与仿真实验视频见https://bow-web.github.io。
原文摘要 · Abstract (English)
This paper introduces the BOW Planner, a scalable motion planning algorithm designed to navigate robots through complex environments using constrained Bayesian optimization (CBO). Unlike traditional methods, which often struggle with kinodynamic constraints such as velocity and acceleration limits, the BOW Planner excels by concentrating on a planning window of reachable velocities and employing CBO to sample control inputs efficiently. This approach enables the planner to manage high-dimensional objective functions and stringent safety constraints with minimal sampling, ensuring rapid and secure trajectory generation. Theoretical analysis confirms the algorithm's asymptotic convergence to near-optimal solutions, while extensive evaluations in cluttered and constrained settings reveal substantial improvements in computation times, trajectory lengths, and solution times compared to existing techniques. Successfully deployed across various real-world robotic systems, the BOW Planner demonstrates its practical significance through exceptional sample efficiency, safety-aware optimization, and rapid planning capabilities, making it a valuable tool for advancing robotic applications. The BOW Planner is released as an open-source package and videos of real-world and simulated experiments are available at https://bow-web.github.io.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。