An adaptive bidirectional quick optimal Rapidly-exploring Random Tree algorithm for path planning

In recent decades, sampling-based algorithms have played an important role in path planning. As an extended algorithm of Rapidly-exploring Random Tree(RRT), the optimal RRT(RRT*) has advantages in asymptotic optimality. However, it still suffers from a slow convergence rate and expensive initial sol...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Engineering applications of artificial intelligence Jg. 135; S. 108776
Hauptverfasser:	Huang, Zhuo, Gao, Yang, Guo, Jian, Qian, Chen, Chen, Qingwei
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Ltd 01.09.2024
Schlagworte:	Narrow passage Path planning Rapidly-exploring Random Tree Sampling-based algorithms Rapidly-exploring Random Tree Narrow passage Path planning Sampling-based algorithms
ISSN:	0952-1976, 1873-6769
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!