Method, server and storage medium for robot routing are provided. An operation area of the robot is gridded into a plurality of cells arranged in rows and columns. The method includes: planning, for the robot, a traveling path from a starting point to a destination point, where the traveling path is divided into a plurality of path segments; and reserving, one or more cells corresponding to a first path segment for the robot, where the first path segment is anyone of at least one among the plurality of path segments, in case that there is the deadlock phenomenon, refraining from reserving the cell for the robot, and re-checking whether the deadlock phenomenon is still present in the cell after a preset interval; and in case that there is no deadlock phenomenon, reserving the cell for the robot.