Path planning problem is the core and hot research topic of multiple Automatic Guided Vehicles (multi-AGVs) system. Although there are many research results, they do not solve the path planning problem from the perspe...Path planning problem is the core and hot research topic of multiple Automatic Guided Vehicles (multi-AGVs) system. Although there are many research results, they do not solve the path planning problem from the perspective of reducing traffic congestion. A collision-free path planning method based on improved A* Algorithm for multi-AGVs logistics sorting system is proposed in this paper. In the method, the environment of warehouse operation for AGVs is described by using grid method. The estimated cost of A* algorithm is improved by adding the penalty value of the paths that AGVs share with each other to alleviate traffic congestion and collision resolution rules are made according to different types of collisions. Then the collision-free path planning is done by combing the improved A* algorithm and collision resolution rules. The sorting efficiency of the method is compared with that of original A* algorithm. Simulation results show that the new collision-free path planning method can improve the sorting efficiency of multi-AGVs system and relieve traffic congestion.展开更多
针对自动化集装箱码头上自动引导车(automated guided vehicle,AGV)数量增加导致冲突更频繁。提出一种改进的基于冲突的搜索(conflict based search,CBS)算法。底层采用基于曼哈顿距离的A算法,上层结合二叉树原理建立冲突树对AGV之间的...针对自动化集装箱码头上自动引导车(automated guided vehicle,AGV)数量增加导致冲突更频繁。提出一种改进的基于冲突的搜索(conflict based search,CBS)算法。底层采用基于曼哈顿距离的A算法,上层结合二叉树原理建立冲突树对AGV之间的冲突进行规避。以最小化AGV在岸桥和堆场之间的总路径长度为目标,使用栅格法建立AGV路网模型。考虑AGV之间的点冲突与边冲突,将自动化码头多AGV无冲突路径规划问题规约为多智能体寻径问题。实验结果表明,所提出的算法在保证堵塞率为0%的前提下,缩短总路径长度并提高运算速度,验证算法的有效性。展开更多
文摘Path planning problem is the core and hot research topic of multiple Automatic Guided Vehicles (multi-AGVs) system. Although there are many research results, they do not solve the path planning problem from the perspective of reducing traffic congestion. A collision-free path planning method based on improved A* Algorithm for multi-AGVs logistics sorting system is proposed in this paper. In the method, the environment of warehouse operation for AGVs is described by using grid method. The estimated cost of A* algorithm is improved by adding the penalty value of the paths that AGVs share with each other to alleviate traffic congestion and collision resolution rules are made according to different types of collisions. Then the collision-free path planning is done by combing the improved A* algorithm and collision resolution rules. The sorting efficiency of the method is compared with that of original A* algorithm. Simulation results show that the new collision-free path planning method can improve the sorting efficiency of multi-AGVs system and relieve traffic congestion.
文摘针对自动化集装箱码头上自动引导车(automated guided vehicle,AGV)数量增加导致冲突更频繁。提出一种改进的基于冲突的搜索(conflict based search,CBS)算法。底层采用基于曼哈顿距离的A算法,上层结合二叉树原理建立冲突树对AGV之间的冲突进行规避。以最小化AGV在岸桥和堆场之间的总路径长度为目标,使用栅格法建立AGV路网模型。考虑AGV之间的点冲突与边冲突,将自动化码头多AGV无冲突路径规划问题规约为多智能体寻径问题。实验结果表明,所提出的算法在保证堵塞率为0%的前提下,缩短总路径长度并提高运算速度,验证算法的有效性。