Dispatching method and device, and non-transitory readable storage medium

A dispatching device, wherein the dispatching device comprises:

• one or more processers;
• and
• a memory coupled to the one or more processors and storing instructions that when executed by the one or more processors, cause the one or more processors to perform one or more operations including:
• obtaining path condition information within a warehouse;
• calculating a pickup time of each candidate robot of a plurality of candidate robots according to a location of the candidate robot and the path condition information, wherein the pickup time of the candidate robot is a time required for the candidate robot to arrive at a pickup location to pick up a cargo and reach a designated target location to complete a pickup task, and the pickup time is obtained by adding an additional pickup time for addressing a path problem to a base pickup time of the candidate robot by walking;
• dispatching a target robot with a shortest pickup time to perform the pickup task according to the pickup time of each candidate robot,
• wherein the additional pickup time is determined according to the following method:
• calculating a first time by dividing an increased distance to bypass an obstacle path segment or a congestion path segment by the candidate robot by a base walking speed of the candidate robot, determining an increased turning time to bypass the obstacle path segment or the congestion path segment as a second time, and determining the additional pickup time of the candidate robot from the first time and the second time, when the path condition information includes obstacle information or congestion information on the shortest path.

A non-transitory readable storage medium storing a computer program, that when executed by a processor, causes the processor to perform a method comprising:

• obtaining path condition information within a warehouse;
• calculating a pickup time of each candidate robot of a plurality of candidate robots according to a location of the candidate robot and the path condition information, wherein the pickup time of the candidate robot is a time required for the candidate robot to arrive at a pickup location to pick up a cargo and reach a designated target location to complete a pickup task, and the pickup time is obtained by adding an additional pickup time for addressing a path problem to a base pickup time of the candidate robot by walking;
• dispatching a target robot with a shortest pickup time to perform the pickup task according to the pickup time of each candidate robot,
• wherein the additional pickup time is determined according to the following method:
• calculating a first time by dividing an increased distance to bypass an obstacle path segment or a congestion path segment by the candidate robot by a base walking speed of the candidate robot, determining an increased turning time to bypass the obstacle path segment or the congestion path segment as a second time, and determining the additional pickup time of the candidate robot from the first time and the second time, when the path condition information includes obstacle information or congestion information on the shortest path.