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...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis-Master by Coursework |
| Language: | English |
| Published: |
Nanyang Technological University
2024
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/173331 |