计算机科学 ›› 2017, Vol. 44 ›› Issue (Z11): 84-87.doi: 10.11896/j.issn.1002-137X.2017.11A.016

• 智能计算 • 上一篇    下一篇

多AGV路径规划方法研究

泰应鹏,邢科新,林叶贵,张文安   

  1. 浙江工业大学信息工程学院 杭州310023,浙江工业大学信息工程学院 杭州310023,浙江工业大学信息工程学院 杭州310023,浙江工业大学信息工程学院 杭州310023
  • 出版日期:2018-12-01 发布日期:2018-12-01
  • 基金资助:
    本文受国家自然科学基金(61573319,61202203),浙江省杰出青年科学基金(LR16F030005)资助

Research of Path Planning in Multi-AGV System

TAI Ying-peng, XING Ke-xin, LIN Ye-gui and ZHANG Wen-an   

  • Online:2018-12-01 Published:2018-12-01

摘要: 针对多自动导引车(Automated Guided Vehicle,AGV)在仓储物流中的路径规划问题,提出一种基于时间窗模型的动态路径规划方法,以实现多AGV的动态路径规划。首先,利用A*算法启发式地为多个AGV规划路径;其次,计算AGV经过路径节点的时间,通过对时间窗的排布和更新解决了多AGV在路径规划中的碰撞冲突问题,而且通过动态地为多AGV分配优先级,提升了系统效率;最后,当路径中出现障碍物时,通过动态更改道路权重,重新进行路径规划,实现了实时避障。仿真实验结果表明,该算法在保证路径最优的条件下能有效避免碰撞冲突,完成无重复、无冲突的系统调度,不仅能提高系统效率,而且在动态环境下具有良好的适应性和鲁棒性。

关键词: 自动导引车,路径规划,时间窗,无碰撞冲突,实时避障

Abstract: In this paper,a dynamic routing method based on time window model was presented for dealing with multi-AGV path planning problem in warehouse.Firstly,A* algorithm is used for completing path routing of multiple AGV.Secondly,the time for AGV passing through the path node’s is calculated.Multi-AGV conflict issues is solved by inserting the time window into path and updating time window.Furthermore,through dynamic allocation of priority for the multi-AGV,the efficiency of system is enhanced.Finally,when the obstacles are in the path,by dynamically changing the path weight,real-time obstacle avoidance is achieved.The simulation results show that the proposed algorithm can effectively avoid collision under the condition of optimal path,the method can not only improve the system efficiency,but also has good adaptability and robustness in dynamic environment.

Key words: Automated guided vehicle,Path planning,Time window,Conflict-free,Real time obstacle avoidance

[1] QIU L,HSU W J.Scheduling and routing algorithms for AGVS:a survey [J].International Journal of Product on Research,2002,40(3):745-760.
[2] OBOTH C,BATTA R,KARWAN M.Dynamic Conflict-FreeRouting of Automated Guided Vehicles[J].International Journal of Production Research,1999,37(9):2003-2030.
[3] SAMIA M,CASTAGNA P.Robust Conflict-Free Routing of Bi-Directional Automated Guided Vehicles Systems[J].IEEE International Conference on Man and Cybernetics,2002(10):6-12.
[4] MHRING R H,KHLER E,GAWRILOW E.Conflict-freereal-time AGV routing[C]∥Operations Research Proceedings 2004.Springer Berlin Heidelberg,2005:18-24.
[5] SMOLIC-ROCAK N,BOGDAN S,KOVACIC Z,et al.TimeWindows Based Dynamic Routing in Multiagv Systems[J].IEEE Transactions on Automation Science and Engineering,2010,7(1):151-155.
[6] 贺丽娜,楼佩煌,钱晓明.基于时间窗的自动导引车无碰撞路径规划[J].计算机集成制造系统,2010,16(12):2630-2634.
[7] BOGDAN S,KOVACIC Z.Time windows based dynamic routing in multi-agv systems[J].Automation Science and Enginee-ring,2010,7(1):151-155.
[8] MAZA S,CASTAGNA P.Conflict-free AGV routing in bi-directional network[C]∥2001 8th IEEE International Conference on Emerging Technologies and Factory Automation,2001.IEEE,2001:761-764.
[9] KALINOVCIC L,PETROVIC T,BOGDAN S,et al.Modified banker’s algorithm for scheduling in multi-agv systems[J].IEEE International Conference on Automation Science and En-gineering,2011,10(3):346-351.
[10] 周明秀,程科,汪正霞.动态路径规划中的改进蚁群算法[J].计算机科学,2013,40(1):314-316.
[11] 徐飞.基于改进人工势场法的机器人避障及路径规划研究[J].计算机科学,2016,3(12):293-296.
[12] 戚铭尧,张金金,任丽.基于时空聚类的带时间窗车辆路径规划算法[J].计算机科学,2014,1(3):218-222.
[13] NISHI T,HIRANAKA Y,GROSSMANN I E.A bilevel decomposition algorithm for simultaneous production scheduling and conflict-free routing for automated guided vehicles[J].Compu-ters & Operations Research,2011,38(5):876-888.
[14] GHASEMZADEH H,BEHRANGI E,ABDOLLAHI A M.Conflict-free scheduling and routing of automated guided vehicles in mesh topologies[J].Robotics and Autonomous Systems,2009,57(6):738-748.

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!