An Adaptive Rapidly-Exploring Random Tree

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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE/CAA journal of automatica sinica Ročník 9; číslo 2; s. 283 - 294
Hlavní autoři: Li, Binghui, Chen, Badong
Médium: Journal Article
Jazyk:angličtina
Vydáno: Piscataway Chinese Association of Automation (CAA) 01.02.2022
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Institute of Artificial Intelligence and Robotics,Xi'an Jiaotong University,Xi'an 710049,China
Témata:
Adaptive sampling
Algorithms
Motion planning
Narrow passage
Path planning
Planning
rapidly-exploring random tree (RRT)-Connect
sampling-based algorithm
Selectivity
Surface treatment
Task analysis
sampling-based algorithm
Narrow passage
path planning
rapidly-exploring random tree (RRT)-Connect
ISSN:2329-9266, 2329-9274
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!
Popis
Shrnutí: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.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2329-9266
2329-9274
DOI:10.1109/JAS.2021.1004252