Loading [MathJax]/extensions/TeX/ieee_stixext.js
Asymptotically near-optimal RRT for fast, high-quality, motion planning | IEEE Conference Publication | IEEE Xplore

Asymptotically near-optimal RRT for fast, high-quality, motion planning


Abstract:

We present Lower Bound Tree-RRT (LBT-RRT), a single-query sampling-based algorithm that is asymptotically near-optimal. Namely, the solution extracted from LBT-RRT conver...Show More

Abstract:

We present Lower Bound Tree-RRT (LBT-RRT), a single-query sampling-based algorithm that is asymptotically near-optimal. Namely, the solution extracted from LBT-RRT converges to a solution that is within an approximation factor of 1 + ε of the optimal solution. Our algorithm allows for a continuous interpolation between the fast RRT algorithm and the asymptotically optimal RRT* and RRG algorithms. When the approximation factor is 1 (i.e., no approximation is allowed), LBT-RRT behaves like the RRT* algorithm. When the approximation factor is unbounded, LBT-RRT behaves like the RRT algorithm. In between, LBT-RRT is shown to produce paths that have higher quality than RRT would produce and run faster than RRT* would run. This is done by maintaining a tree which is a sub-graph of the RRG roadmap and a second, auxiliary tree, which we call the lower-bound tree. The combination of the two trees, which is faster to maintain than the tree maintained by RRT*, efficiently guarantee asymptotic near-optimality. We suggest to use LBT-RRT for high-quality, anytime motion planning. We demonstrate the performance of the algorithm for scenarios ranging from 3 to 12 degrees of freedom and show that even for small approximation factors, the algorithm produces high-quality solutions (comparable to RRT*) with little runtime overhead when compared to RRT.
Date of Conference: 31 May 2014 - 07 June 2014
Date Added to IEEE Xplore: 29 September 2014
Electronic ISBN:978-1-4799-3685-4
Print ISSN: 1050-4729
Conference Location: Hong Kong, China
No metrics found for this document.

I. Introduction and Related Work

Motion planning is a fundamental research topic in robotics with applications in diverse domains such as surgical planning, computational biology, autonomous exploration, search-and-rescue, and warehouse management. Sampling-based planners such as PRM [1], RRT [2] and their many variants enabled solving motion-planning problems that had been previously considered infeasible [3]. Gradually, the interest in the motion-planning community shifted from finding an arbitrary solution to the motion-planning problem to finding a high-quality solution. Quality can be measured in terms of, for example, length, clearance, smoothness, energy, to mention a few criteria, or some combination of the above.

Usage
Select a Year
2025

View as

Total usage sinceOct 2014:624
012345JanFebMarAprMayJunJulAugSepOctNovDec431000000000
Year Total:8
Data is updated monthly. Usage includes PDF downloads and HTML views.

Contact IEEE to Subscribe

References

References is not available for this document.