CDRT-RRT: Real-time rapidly exploring Random Tree Star based on convex dissection

This study presents CDRT-RRT*, an algorithm for rapid real-time path planning in N-dimensional Euclidean spaces, based on convex dissection. CDRT-RRT* introduces a convex dissection dynamic neighborhood graph that differs from traditional methods by effectively guiding the sampling and connection pr...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Expert systems with applications Jg. 268; S. 126291
Hauptverfasser:	Liu, Jinyuan, Fu, Minglei, Zhang, Wenan, Chen, Bo, Sychou, Uladzislau, Belotserkovsky, Alexei
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Ltd 05.04.2025
Schlagworte:	Navigation Optimal distance Real-time path planning Sampling-based algorithms Real-time path planning Navigation Sampling-based algorithms Optimal distance
ISSN:	0957-4174
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!