To solve path planning problems of accessing cars by AGV (automated guided vehicle) in the intelligent lift parking garage,the strategies of time-sharing use were utilized,and a path planning method of parking system based on dynamic time window was proposed through effec-tively combining Dijkstra algorithm and time window.First of all,the AGV having task was as-signed the priorities by the introduction of priority strategy.Then,according to the task priority order,Dijkstra algorithm was used to plan the shortest feasible path for the AGV having task. Finally,on the basis of feasible AGV's path,multiple AGV collision-free path planning was a-chieved by the method which contained time window initialization,time window real-time update and real-time arrangement.To test and verify the feasibility and effectiveness of path planning al-gorithm of parking system based on dynamic time window,the intelligent lift parking garage with four AGVs working at the same time was tested in the simulation experiment.The experi-mental results showed that the proposed method could solve some problems in the multiple AGV path planning,which included poor flexibility,easily arising deadlock conflict and collision con-flict,etc.Furthermore,the proposed method also could plan out a minimum-time optimal path for the AGV having task under the premise of effectively solving path conflicts.The results indi-cate that the method is correct,feasible and effective,and has a better robustness and flexible. Besides,it can effectively improve the overall operating efficiency of the intelligent parking system and reduce waiting time for accessing cars.