基于A^(*)蚁群混合算法的AGV路径规划

AGV Path Planning Based on A^(*)Ant Colony Hybrid Algorithm

笔者针对可移动货架式智能仓库拣货时一个订单上有多条货物,AGV取货时的顺序会对取货路径产生较大影响的问题,提出了一种A^(*)蚁群混合算法的AGV寻路算法,在AGV计算取货路线前,先用蚁群算法对订单货物捡取顺序进行优化,再利用A*算法进行AGV路径规划,并用Matlab进行仿真实验。结果证明,混合算法比单纯用A*算法直接取货距离更优。

Aiming at the problem that there are multiple goods on an order when picking goods in a mobile rack-type intelligent warehouse,the order of the AGV picking up will have a greater impact on the picking path,and proposed an A^(*)ant colony hybrid algorithm for AGV search.Route algorithm.Before the AGV calculates the pick-up route,the ant colony algorithm is used to optimize the picking order of the order goods,and then the A*algorithm is used to plan the AGV path,and Matlab is used for simulation experiments.The results prove that the hybrid algorithm is better than simply using the A^(*)algorithm to pick up the goods directly.