现代信息科技2024，Vol.8Issue(5)：183-189,7.DOI:10.19850/j.cnki.2096-4706.2024.05.040
基于冲突搜索的多AGV路径规划
Multi-AGV Path Planning Based on Conflict Search
摘要
Abstract
In order to achieve automated operations in the warehousing process,research is conducted on multi-AGV path planning.A grid map method is used to construct a map environment,and based on the single path A* search algorithm,a conflict search algorithm for dual layer path planning is adopted to solve the multi-AGV path conflict problem.The specific implementation method is to perform conflict detection and constraint addition at the upper level,and A* algorithm is used at the lower level for single path planning.Finally,it uses Python's matplotlib library programing to simulate the path planning algorithm.The simulation results indicate that the planning method used in this project is effective.关键词
路径规划/CBS算法/A*算法/AGV/栅格地图Key words
path planning/CBS algorithm/A* algorithm/AGV/grid map分类
信息技术与安全科学引用本文复制引用
魏胜利,张涛..基于冲突搜索的多AGV路径规划[J].现代信息科技,2024,8(5):183-189,7.基金项目
安阳市科技发展计划(2022C01SF117) （2022C01SF117）
安阳工学院科研基金(YPY2022011) （YPY2022011）
