基于冲突搜索的多AGV路径规划OA

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.