Journal article 95 views 21 downloads
Target-biased informed trees: sampling-based method for optimal motion planning in complex environments
Journal of Computational Design and Engineering, Volume: 9, Issue: 2, Pages: 755 - 771
Swansea University Author:
Chunxu Li
-
PDF | Version of Record
Copyright: TheAuthor(s) 2022. This is an Open Access article distributed under the terms of the Creative Commons Attribution License.
Download (6.31MB)
DOI (Published version): 10.1093/jcde/qwac025
Abstract
Aiming at the problem that the progressively optimized Rapidly-exploring Random Trees Star (RRT*) algorithm generates a large number of redundant nodes, which causes slow convergence and low search efficiency in high-dimensional and complex environments. In this paper we present Target-biased Inform...
| Published in: | Journal of Computational Design and Engineering |
|---|---|
| ISSN: | 2288-5048 |
| Published: |
Oxford University Press (OUP)
2022
|
| Online Access: |
Check full text
|
| URI: | https://cronfa.swan.ac.uk/Record/cronfa65998 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract: |
Aiming at the problem that the progressively optimized Rapidly-exploring Random Trees Star (RRT*) algorithm generates a large number of redundant nodes, which causes slow convergence and low search efficiency in high-dimensional and complex environments. In this paper we present Target-biased Informed Trees (TBIT*), an improved RRT* path planning algorithm based on target-biased sampling strategy and heuristic optimization strategy. The algorithm adopts a combined target bias strategy in the search phase of finding the initial path to guide the random tree to grow rapidly toward the target direction, thereby reducing the generation of redundant nodes and improving the search efficiency of the algorithm; after the initial path is searched, heuristic sampling is used to optimize the initial path instead of optimizing the random tree, which can benefit from reducing useless calculations, and improve the convergence capability of the algorithm. The experimental results show that the algorithm proposed in this article changes the randomness of the algorithm to a certain extent, and the search efficiency and convergence capability in complex environments have been significantly improved, indicating that the improved algorithm is feasible and efficient. |
|---|---|
| Keywords: |
path planning, rapidly exploring random trees, improved RRT*, target bias, heuristic |
| College: |
Faculty of Science and Engineering |
| Issue: |
2 |
| Start Page: |
755 |
| End Page: |
771 |