The invention relates to a path planning method, and specifically relates to a time window-based task segmentation multi-AGV path planning algorithm. The method comprises steps of first, generating anAGV working environment model; second, generating a task, and decomposing the task into multiple secondary stages according to different task types; and third, assigning the task by a task assigningmodule according to task priorities, picking the task out by a scheduling system from a high-priority queue, then determining which stage the task is in, if the task is not executed, assigning the task to closest AGV by using an improved A* algorithm, and setting the task state in first secondary stage; if the task is in the second or after stages, and planning a non-conflict shortest path for theAGV bound with the task by using the time widow algorithm by the scheduling system. Shortest and fastest paths are planned by using the improved A* algorithm and time window algorithm, so that the working efficiency is improved and calculation errors are reduced.