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 rat...
| Egile Nagusiak: | , , , , , |
|---|---|
| Formatua: | Artikulua |
| Hizkuntza: | English |
| Argitaratua: |
Springer
2023-06-01
|
| Saila: | Complex & Intelligent Systems |
| Gaiak: | |
| Sarrera elektronikoa: | https://doi.org/10.1007/s40747-023-01111-6 |