关键词: AGV路径规划, A*算法, 负载均衡, 局部拥塞

Abstract:

Focusing on the application scenario of large-scale multi-AGV path planning, in order to solve the problem that the node preempting of multiple AGVs during path planning may result in excessive load on the node, cause local congestion, and reduce the operating efficiency of the entire system, this paper proposes an improved A* algorithm based on referring to the node load conditions. According to the algorithm, for the load of each node, starting from the initial value, the load of the node will be dynamically updated according to the corresponding dynamic load calculation formula. It introduces the load into the heuristic function of the A* algorithm to affect the AGV path selection through the node load and avoid high-load nodes. Through corresponding simulation experiments, it proves that the algorithm is conductive to effectively balance the load of each node and improve the efficiency of system operation.

Key words: AGV path planning, A* algorithm, load balancing, local congestion