Warehouse Robot Dispatch Using Path-Aware Pickup Time
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In unmanned warehouses, relying on distance to dispatch robots for cargo pickup can result in longer pickup times and inefficient operations due to obstacles and congestion, leading to unsatisfactory efficiency.
Innovation Solution
A method that calculates the pickup time for each candidate robot based on its location and path condition information, including travel direction, obstacles, and congestion, to select the shortest total pickup time, thereby optimizing the dispatching process and improving efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If distance-based dispatching is used to assign pickup tasks to robots, then the dispatching process is simple, but the pickup time increases and operational efficiency decreases due to obstacles and congestion
Solution Approach 1:
The patent changes the dispatching parameter from simple distance to comprehensive pickup time, which incorporates path conditions such as obstacles and congestion. The system calculates pickup time for each candidate robot by considering not only the distance but also the actual path conditions, thereby selecting the robot that can complete the task fastest rather than simply the closest one.
Solution Approach 2:
The patent introduces path condition information as an intermediary factor between the robot's location and the final dispatching decision. This intermediary data (including obstacles, congestion, and travel directions) modifies the simple distance metric to produce a more accurate pickup time estimation, enabling better dispatching decisions.
2Speed
If the shortest path is selected without considering path conditions, then the basic travel time is minimized, but additional time is required to address obstacles and congestion
Solution Approach 1:
The patent performs preliminary calculation of additional pickup time required to address path problems before finalizing the dispatching decision. By预先 estimating the time needed to handle obstacles and congestion, the system can accurately compare total pickup times of different robots and select the optimal candidate, avoiding situations where a robot encounters significant delays during execution.
Data Source
AI summary
The present disclosure discloses a dispatching method and device, and a non-transitory readable storage medium, and relates to the field of computer technology. The method of the present disclosure includes: obtaining path condition information within a warehouse; calculating 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; dispatching a target robot to perform a pickup task according to the pickup time of each candidate robot.