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

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 imp...

Celý popis

Podrobná bibliografie

Vydáno v:	Complex & intelligent systems Ročník 9; číslo 6; s. 7249 - 7267
Hlavní autoři:	Cong, Jiping, Hu, Jianbo, Wang, Yingyang, He, Zihou, Han, Linxiao, Su, Maoyu
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Cham Springer International Publishing 01.12.2023 Springer
Témata:	Complexity Computational Intelligence Data Structures and Information Theory Engineering Optimal path planning Original Article Path planning Rapidly exploring random tree star (RRT) Sampling-based algorithm Path planning Optimal path planning Rapidly exploring random tree star (RRT) Sampling-based algorithm
ISSN:	2199-4536, 2198-6053
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!