arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1507.07602cs.RO
收藏

基于渐近最优采样的双向运动规划算法

An Asymptotically-Optimal Sampling-Based Algorithm for Bi-directional Motion Planning

Stanford University(斯坦福大学);Carlos III University of Madrid(马德里卡洛斯三世大学)

Joseph A. Starek, Javier V. Gomez, Edward Schmerling, Lucas Janson, Luis Moreno, Marco Pavone

摘要:

双向搜索是一种广泛使用的策略,以提高基于采样的运动规划算法的成功率和收敛速度。然而,很少有结果是合并双向搜索和渐近最优性到现有的最优规划,如PRM*,RRT*,和FMT*。本文的目的就是填补这一空白。具体而言,本文提出了一种双向的,基于采样,渐进最优算法双向FMT*(BFMT*),扩展了快速行进树(FMT*)算法的双向搜索,同时保持其关键属性,主要是懒惰的搜索和渐近最优性,通过收敛的概率。BFMT* 在一组随机抽取的样本上执行双源、惰性动态规划递归,相应地生成两个搜索树:一个在初始配置的成本空间中,另一个在目标配置的成本空间中。数值实验说明了BFMT* 的优势,其单向对应,以及一些其他国家的最先进的规划。

英文摘要:

Bi-directional search is a widely used strategy to increase the success and convergence rates of sampling-based motion planning algorithms. Yet, few results are available that merge both bi-directional search and asymptotic optimality into existing optimal planners, such as PRM*, RRT*, and FMT*. The objective of this paper is to fill this gap. Specifically, this paper presents a bi-directional, sampling-based, asymptotically-optimal algorithm named Bi-directional FMT* (BFMT*) that extends the Fast Marching Tree (FMT*) algorithm to bi-directional search while preserving its key properties, chiefly lazy search and asymptotic optimality through convergence in probability. BFMT* performs a two-source, lazy dynamic programming recursion over a set of randomly-drawn samples, correspondingly generating two search trees: one in cost-to-come space from the initial configuration and another in cost-to-go space from the goal configuration. Numerical experiments illustrate the advantages of BFMT* over its unidirectional counterpart, as well as a number of other state-of-the-art planners.

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

↑