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

通过快速全对r-最近邻实现高效高质量运动规划

Efficient high-quality motion planning by fast all-pairs r-nearest-neighbors

Blavatnik School of Computer Science, Tel-Aviv University(特拉维夫大学布拉瓦尼克计算机科学学院);Tel Aviv University(特拉维夫大学)

Michal Kleinbort, Oren Salzman, Dan Halperin

摘要:

基于采样的运动规划算法在构造路线图时通常依赖于最近邻(NN)查询。最近的研究结果表明,在各种设置NN查询可能是这种算法的计算瓶颈。此外,在一些渐近最优算法中,这些NN查询具有特定的形式:给定一组点和半径r,报告距离最多为r的所有点对。这就需要一个应用程序特定的NN数据结构,以有效地回答这种类型的查询。随机变换网格(RTG)最近由Aiger等人提出,作为回答这种查询的工具,并已被证明在这种情况下优于NN数据结构的常见实现。在这项工作中,我们采用RTG采样为基础的运动规划算法,并描述了一个有效的实现方法。我们表明,运动规划,RTG允许更快的收敛到高质量的解决方案相比,现有的NN数据结构。此外,RTG可以显著缩短批量PRM变体的构建时间;具体来说,我们在某些场景中展示了2到3倍的加速。

英文摘要:

Sampling-based motion-planning algorithms typically rely on nearest-neighbor (NN) queries when constructing a roadmap. Recent results suggest that in various settings NN queries may be the computational bottleneck of such algorithms. Moreover, in several asymptotically-optimal algorithms these NN queries are of a specific form: Given a set of points and a radius r report all pairs of points whose distance is at most r. This calls for an application-specific NN data structure tailored to efficiently answering this type of queries. Randomly transformed grids (RTG) were recently proposed by Aiger et al. as a tool to answer such queries and have been shown to outperform common implementations of NN data structures in this context. In this work we employ RTG for sampling-based motion-planning algorithms and describe an efficient implementation of the approach. We show that for motion-planning, RTG allow for faster convergence to high-quality solutions when compared with existing NN data structures. Additionally, RTG enable significantly shorter construction times for batched-PRM variants; specifically, we demonstrate a speedup by a factor of two to three for some scenarios.

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

↑