Conflict-Free Path Planning of AGV based on Improved A-star Algorithm
This paper proposes an improved A* algorithm based on time-window to solve the conflict-free path planning problem for Automated Guided Vehicles (AGVs). In particular, a more precise estimate of the turning time is introduced so that a more accurate prediction of node conflict can be achieved during the path planning stage. Furthermore, a more precise estimation of heuristic value in the A* evaluation function is introduced in which it can further speed up the path searching process as some sub-optimal path candidates will not be checked during the process.
A* algorithm, Path Planning, Time Window, Conflict-Free, AGV
2nd International Conference on Information, Communication and Engineering (ICICE 2018)
Full paper download: