.png){kind=icon}
返回
An improved RRT* algorithm for robot path planning based on path expansion heuristic sampling
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jocs.2022.101937.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Rapidly-exploring Random Tree Star (RRT*) algorithm and its variants based on random sampling can provide a collision-free and asymptotic optimal solution for many path planning problems. However, many RRT* based variants have low sampling efficiency and slow convergence rate in the environment which consists of long corridors, due to a large number of iterations are required in sampling critical nodes. To overcome this problem, the paper proposes the Expanding Path RRT* (EP-RRT*) based on heuristic sampling in path expansion area. By combining the greedy heuristic of Rapidly exploring Random Tree (RRT)-Connect, EP-RRT* quickly explores the environment in order to find a feasible path, and then expands it to obtain the heuristic sampling area. It iteratively searches in the heuristic sampling area which also changes with the continuous optimization of the path, and finally obtains an optimal or suboptimal path connecting starting point and target point. Comparisons of EPRRT* with RRT* and Informed RRT* in four simulation environments verify that EP-RRT* improves the node utilization, accelerates the convergence rate, and obtains a better path for the same number of iterations.
Keyword:
Path planning
Narrow corridor
RRT*
Heuristic sampling
期刊
IF:
18.3
论文数:
3.1K
被引数:
4.0K
机构
引用论文
Analysis of plate and colony precipitates decorating stacking faults in a single-crystal silicon
PREAI
分享收藏Path Planning Method With Improved Artificial Potential Field-A Reinforcement Learning Perspective基于强化学习视角的改进人工势场路径规划方法.png)
IEEE ACCESS
OAAI
IEEE ACCESSIF3.6
OAAI分享收藏分享收藏分享收藏Multi-objective path planner for an agricultural mobile robot in a virtual greenhouse environment
PREAI
分享收藏
查看更多内容