Fast-RRT: A RRT-Based Optimal Path Finding Method
As a sampling-based pathfinding algorithm, Rapidly Exploring Random Trees (RRT) has been widely used in motion planning problems due to the ability to find a feasible path quickly. However, the RRT algorithm still has several shortcomings, such as the large variance in the search time, poor performa...
שמור ב:
| Principais autores: | , , , |
|---|---|
| פורמט: | Artigo |
| שפה: | Inglês |
| יצא לאור: |
MDPI AG
2021-12-01
|
| סדרה: | Applied Sciences |
| נושאים: | |
| גישה מקוונת: | https://www.mdpi.com/2076-3417/11/24/11777 |
| תגים: |
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|