Fast-RRT: A RRT-based optimal path finding method

45Citations
Citations of this article
35Readers
Mendeley users who have this article in their library.

Abstract

As a sampling-based pathfinding algorithm, Rapidly Exploring Random Trees (RRT) has been widely used in motion planning problems due to the ability to find a feasible path quickly. However, the RRT algorithm still has several shortcomings, such as the large variance in the search time, poor performance in narrow channel scenarios, and being far from the optimal path. In this paper, we propose a new RRT-based path find algorithm, Fast-RRT, to find a near-optimal path quickly. The Fast-RRT algorithm consists of two modules, including Improved RRT and Fast-Optimal. The former is aims to quickly and stably find an initial path, and the latter is to merge multiple initial paths to obtain a near-optimal path. Compared with the RRT algorithm, Fast-RRT shows the following improvements: (1) A Fast-Sampling strategy that only samples in the unreached space of the random tree was introduced to improve the search speed and algorithm stability; (2) A Random Steering strategy expansion strategy was proposed to solve the problem of poor performance in narrow channel scenarios; (3) By fusion and adjustment of paths, a near-optimal path can be faster found by Fast-RRT, 20 times faster than the RRT* algorithm. Owing to these merits, our proposed Fast-RRT outperforms RRT and RRT* in both speed and stability during experiments.

References Powered by Scopus

A note on two problems in connexion with graphs

18653Citations
N/AReaders
Get full text

A Formal Basis for the Heuristic Determination of Minimum Cost Paths

9190Citations
N/AReaders
Get full text

Probabilistic roadmaps for path planning in high-dimensional configuration spaces

4970Citations
N/AReaders
Get full text

Cited by Powered by Scopus

Autonomous docking trajectory optimization for unmanned surface vehicle: A hierarchical method

30Citations
N/AReaders
Get full text

APF-IRRT*: An Improved Informed Rapidly-Exploring Random Trees-Star Algorithm by Introducing Artificial Potential Field Method for Mobile Robot Path Planning

22Citations
N/AReaders
Get full text

A Disaster Relief UAV Path Planning Based on APF-IRRT* Fusion Algorithm

19Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Wu, Z., Meng, Z., Zhao, W., & Wu, Z. (2021). Fast-RRT: A RRT-based optimal path finding method. Applied Sciences (Switzerland), 11(24). https://doi.org/10.3390/app112411777

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 5

50%

Researcher 3

30%

Lecturer / Post doc 2

20%

Readers' Discipline

Tooltip

Engineering 10

77%

Computer Science 3

23%

Save time finding and organizing research with Mendeley

Sign up for free