Warehouse Robot Path Allocation Using Under-Shelf Passages
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In warehouse environments with multiple robots performing tasks, the paths allocated by scheduling devices often conflict, leading to congestion due to shared use of areas without goods, especially when robots are in non-load states.
Innovation Solution
A method and apparatus for path allocation that determines a robot's destination and allocates a path based on passages under goods shelves not occupied by any robot, prioritizing these passages to minimize conflicts and congestion.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If the scheduling device allocates paths for multiple robots based on areas where no goods shelves are placed, then robots can travel to task sites, but path conflicts and congestion occur when many robots share the same areas
Solution Approach 1:
The patent segments the warehouse space into two distinct types of passages: target passages (areas under goods shelves) and passable passages (areas without goods shelves). This segmentation allows different robot types to use different passages, thereby reducing path conflicts and congestion that occur when all robots share the same passable passages.
Solution Approach 2:
The patent applies local quality by assigning different passage usage rights to different robot states. Non-load robots are permitted to traverse target passages (under goods shelves) while fully-loaded robots are restricted to passable passages. This localized differentiation optimizes space utilization and reduces congestion in specific areas based on robot characteristics.
2Reliability
If robots are restricted to travel only in areas where no goods shelves are placed, then path conflicts are reduced, but the available travel area is limited and space utilization is inefficient
Solution Approach 1:
The patent segments passage usage rights based on robot load state. Target passages (under goods shelves) are segmented for exclusive use by non-load robots, while passable passages remain available for fully-loaded robots. This segmentation increases overall space utilization by allowing non-load robots to access previously restricted areas without causing conflicts to loaded robots.
Solution Approach 2:
The patent implements local quality by permitting non-load robots to traverse target passages (areas under goods shelves) while restricting fully-loaded robots to passable passages. This localized permission structure maximizes space utilization by utilizing the previously underused target passages for robot movement, thereby improving overall productivity without causing path conflicts.
3Device complexity
If the scheduling device uses traditional path allocation methods, then path allocation is simple, but congestion occurs in areas under goods shelves where multiple robots are present
Solution Approach 1:
The patent introduces a segmented path allocation method that divides the warehouse into target passages and passable passages. The scheduling device allocates paths by first determining robot load state, then directing non-load robots through target passages and loaded robots through passable passages. This segmentation approach maintains relatively simple scheduling logic while effectively reducing congestion in areas under goods shelves.
Data Source
Figure 1~3
Figure 4
Figure 5~6
AI summary
An embodiment of the present application provides a method and an apparatus for path allocation, and relates to the technical field of data processing. The method includes: if a target robot is in a non-load state, determining a destination of the target robot; allocating a path leading to the destination for the target robot based on a target passage in which space under the goods shelves is not occupied by any robot; and sending the allocated path for the target robot. The solution provided by the embodiment of the present application can reduce the probability of congestion of the robots in the warehouse.