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

Full description

Saved in:

Bibliographic Details
Published in:	Sensors (Basel, Switzerland) Vol. 25; no. 7; p. 2067
Main Authors:	Chu, Yang, Chen, Quanlin, Yan, Xuefeng
Format:	Journal Article
Language:	English
Published:	Switzerland MDPI AG 26.03.2025 MDPI
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!