Scheduling method for multiple AGVs in closed automatic logistics park

Abstract

The invention discloses a scheduling method for multiple AGVs in a closed automatic logistics park. The method comprises the following steps of 1) preparing; 2) planning a path based on a Dijkstra algorithm framework; and 3) according to the step 1) and the step 2), implementing the following traffic control logics of 3.1) updating the pose of the AGV and clearing the tail; 3.2) calculating an application area by utilizing a greedy strategy; 3.3) calculating a detection area; 3.4) calculating whether a deadlock ring exists or not, if yes, processing the deadlock ring, and circularly calculating whether the deadlock ring exists or not. According to the present invention, the concurrent capacity of the AGVs is utilized fully, the higher-density vehicle scheduling in the limited places is realized, and the higher operation efficiency is achieved.

Description

technical field [0001] The invention relates to a scheduling method for AGV horizontal transport equipment, more specifically, to a scheduling method for multiple AGVs in a closed automated logistics park. Background technique [0002] The logistics park refers to the working area where the goods are moved within a limited range by means of handling equipment. The closed automated logistics park refers to a logistics park that uses automated handling equipment and is completely isolated from manual handling equipment. The park has planned access roads and interactive nodes. The road design usually allows the handling equipment to go straight, turn, and rotate in situ. Intersections are allowed between roads, even dense intersections, and no traffic lights are used to control traffic. This kind of logistics park design is usually used in the fields of automated container terminals, automated airports, automated warehousing, and automated parking garages. With the development...

AI Technical Summary

Problems solved by technology

[0010] (2) deadlock

However, the problem with this method is that you need to bring the estimated time when doing route planning, and because of uncontrollable factors such as the actual vehicle machinery, the estimated passing time will be inaccurate, and the farther the distance is, the worse the accuracy will be.

This leads to two results: A) If the schedule is scheduled according to the original plan, early vehicles will have to wait, and late vehicles will cause unexpected congestion; B) If the route needs to be adjusted in real time, the calculation is difficult and stressful, and at the same time for Unexpected waits caused by processing delays, path fallbacks may occur

Images