| Path planning is an important factor for material handling in warehouse. Material handling has to go to certain rack, unload the product on loading dock and return to its depot. There are few available path can be taken by the material handling but not every path is the optimum one. Since the shortest path has to be achieved, it needs an algorithm to optimize the path. Therefore, A Star Algorithm is used to optimize the path. A Star algorithm consider both weight score and heuristic score so it can produce the shortest path with less effort.Implementation of algorithm produces shortest path with less time needed. The less time needed for AGV to finish a task, the more tasks can be done by a single robot. Therefore, the utilization of material handling will be improved. Furthermore, there will be more tasks can be finished in a certain time. X company’s warehouse is redefined as a grid layout. The available path is denoted as a node. A Star algorithm is applied for finding the shortest path from depot to certain rack, then deliver it to the loading dock and return to the depot. The shortest path from depot to the rack takes 9 steps, from the rack to loading dock takes 40 steps and from loading dock to the depot takes 29 steps. The path planning for Automatic Guided Vehicle will be verified based on the program has been made in Python Programming Language. |