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

渐近最优Kinodynamic规划在状态-费用空间中的精细分析

Refined Analysis of Asymptotically-Optimal Kinodynamic Planning in the State-Cost Space

Tel-Aviv University(特拉维夫大学);Rutgers University(罗格斯大学);Stanford University(斯坦福大学)

Michal Kleinbort, Edgar Granados, Kiril Solovey, Riccardo Bonalli, Kostas E. Bekris, Dan Halperin

摘要:

我们提出了一种新的AO-RRT分析:一种基于树的计划器,用于具有运动动力学约束的运动规划,最初由Hauser和Zhou(AO-X,2016)描述。AO-RRT探索状态成本空间,并已被证明在实践中有效地获得高质量的解决方案,而不依赖于计算密集型两点边界值求解器的可用性。我们的主要贡献是单树版本的算法的最优性证明-一个以前没有分析过的变体。我们的证明只需要一个温和的和容易验证的问题和系统的假设:成本函数和动力学的Lipschitz连续性。特别是,我们证明,对于任何系统满足这些假设,任何轨迹具有分段常数控制功能和积极的清除障碍物可以近似任意以及由AO-RRT发现的轨迹。我们还讨论了实际方面的AO-RRT和目前的实验比较的算法的变体。

英文摘要:

We present a novel analysis of AO-RRT: a tree-based planner for motion planning with kinodynamic constraints, originally described by Hauser and Zhou (AO-X, 2016). AO-RRT explores the state-cost space and has been shown to efficiently obtain high-quality solutions in practice without relying on the availability of a computationally-intensive two-point boundary-value solver. Our main contribution is an optimality proof for the single-tree version of the algorithm---a variant that was not analyzed before. Our proof only requires a mild and easily-verifiable set of assumptions on the problem and system: Lipschitz-continuity of the cost function and the dynamics. In particular, we prove that for any system satisfying these assumptions, any trajectory having a piecewise-constant control function and positive clearance from the obstacles can be approximated arbitrarily well by a trajectory found by AO-RRT. We also discuss practical aspects of AO-RRT and present experimental comparisons of variants of the algorithm.

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

↑