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...
| Published in: | Sensors |
|---|---|
| Main Authors: | , , |
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-03-01
|
| Subjects: | |
| Online Access: | https://www.mdpi.com/1424-8220/25/7/2067 |
