2023
DOI: 10.1007/s40747-023-01111-6
|View full text |Cite
|
Sign up to set email alerts
|

FF-RRT*: a sampling-improved path planning algorithm for mobile robots against concave cavity obstacle

Abstract: The slow convergence rate and large cost of the initial solution limit the performance of rapidly exploring random tree star (RRT*). To address this issue, this paper proposes a modified RRT* algorithm (defined as FF-RRT*) that creates an optimal initial solution with a fast convergence rate. An improved hybrid sampling method is proposed to speed up the convergence rate by decreasing the iterations and overcoming the application limitation of the original hybrid sampling method towards concave cavity obstacle… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
2
1
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 33 publications
0
1
0
Order By: Relevance
“…Taking the FF-RRT* algorithm as an example [8], it combines the advantages of Fast-RRT* [9] and F-RRT* [10] algorithms while overcoming their weaknesses. FF-RRT* utilizes the improved HybridSampling method to enhance the quality of sampling, addressing the computational time issues in the CreatNode procedure of F-RRT*, and eliminating the applicability constraints of Fast-RRT*.…”
Section: Autonomy and Safetymentioning
confidence: 99%
“…Taking the FF-RRT* algorithm as an example [8], it combines the advantages of Fast-RRT* [9] and F-RRT* [10] algorithms while overcoming their weaknesses. FF-RRT* utilizes the improved HybridSampling method to enhance the quality of sampling, addressing the computational time issues in the CreatNode procedure of F-RRT*, and eliminating the applicability constraints of Fast-RRT*.…”
Section: Autonomy and Safetymentioning
confidence: 99%