The invention discloses a parking
system path
planning method based on dynamic
time windows, and belongs to the technical field of path planning. The method is characterized by comprising the following steps: S1, building a work environment model of AGVs in an intelligent garage in a topological method; S2, setting priority for each AGV and each
car parking / picking task according to different evaluation criteria; S3, using a Dijkstra
algorithm to plan a shortest possible path for an AGV accepting a task; S4, arranging feasible path
time windows; S5, designing conflict resolution strategies according to different types of conflicts; and S6, planning a conflict-free optimal path for the AGV using a parking
system path planning
algorithm based on dynamic
time windows. A time-sharing use strategy is used, and the Dijkstra
algorithm and a time window method are combined effectively, so that the problem that the existing multi-AGV path planning is of poor flexibility and is prone to
deadlock or collision conflict is solved effectively, and a shortest conflict-free optimal path can be planned for an AGV accepting a task. In addition, the overall operation efficiency of an intelligent three-dimensional parking
system can be improved effectively, and the
car parking / picking
waiting time can be reduced for social members.