.png){kind=icon}
Return
An Adaptive Rapidly-Exploring Random Tree
.png){kind=icon}
PRE
AI
DOI：10.1109/JAS.2021.1004252.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Sampling-based planning algorithms play an important role in high degree-of-freedom motion planning (MP) problems, in which rapidly-exploring random tree (RRT) and the faster bidirectional RRT (named RRT-Connect) algorithms have achieved good results in many planning tasks. However, sampling-based methods have the inherent defect of having difficultly in solving planning problems with narrow passages. Therefore, several algorithms have been proposed to overcome these drawbacks. As one of the improved algorithms, Rapidly-exploring random vines (RRV) can achieve better results, but it may perform worse in cluttered environments and has a certain environmental selectivity. In this paper, we present a new improved planning method based on RRT-Connect and RRV, named adaptive RRT-Connect (ARRT-Connect), which deals well with the narrow passage environments while retaining the ability of RRT algorithms to plan paths in other environments. The proposed planner is shown to be adaptable to a variety of environments and can accomplish path planning in a short time.
Keywords:
Narrow passage
path planning
rapidly-exploring random tree (RRT)-Connect
sampling-based algorithm
Journal
I
IF:
19.2
Papers:
1.4K
Citations:
1.1W
Organization
Cited Papers
A Heuristic Rapidly-Exploring Random Trees Method for Manipulator Motion Planning.png)
IEEE ACCESS
OAAI
IEEE ACCESSIF3.6
OAAIShareSaveShareSaveSystematic Literature Review of Sampling Process in Rapidly-Exploring Random TreesIEEE ACCESSOAAI
IEEE ACCESSIF3.6
OAAIShareSaveLes métalloprotéases matricielles et leurs inhibiteurs synthétiques dans la progression tumoraleOAAI
OAAIShareSavePath Planning of Industrial Robot Based on Improved RRT Algorithm in Complex EnvironmentsIEEE ACCESSOAAI
IEEE ACCESSIF3.6
OAAIShareSave
View more