An Overview and Comparison of Traditional Motion Planning Based on Rapidly Exploring Random Trees

Motion planning is a fundamental problem in robotics that involves determining feasible or optimal paths within finite time. While complete motion planning algorithms are guaranteed to converge to a path solution in finite time, they are proven to be computationally inefficient, making them unsuitab...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Sensors (Basel, Switzerland) Ročník 25; číslo 7; s. 2067
Hlavní autori:	Chu, Yang, Chen, Quanlin, Yan, Xuefeng
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Switzerland MDPI AG 26.03.2025 MDPI
Predmet:	Algorithms Control systems Controllers Equilibrium Heuristic kinodynamic planning Motion motion planning Neighborhoods Optimization algorithms Robotics Robots sampling-based algorithms China kinodynamic planning motion planning sampling-based algorithms
ISSN:	1424-8220, 1424-8220
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!