A greedy, deterministic sampling-based path planning algorithm for AGV
This paper proposes a novel global path planning algorithm for Automated Guided Vehicles (AGVs). The algorithm extends the path with incremental sampling, using a greedy heuristic strategy to prioritize samples close to the goal. It also employs a vertex evaluation scheme to navigate around the obst...
Saved in:
| 主要作者: | |
|---|---|
| 其他作者: | |
| 格式: | Thesis-Master by Coursework |
| 語言: | English |
| 出版: |
Nanyang Technological University
2024
|
| 主題: | |
| 在線閱讀: | https://hdl.handle.net/10356/173331 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|