Collaborative optimization of task scheduling and multi-agent path planning in automated warehouses
Task scheduling
Intelligent warehouse
Electronic computers. Computer science
HEFT
0211 other engineering and technologies
QA75.5-76.95
Information technology
02 engineering and technology
T58.5-58.64
Picking
Multi-agent path finding
DOI:
10.1007/s40747-023-01023-5
Publication Date:
2023-04-15T07:02:14Z
AUTHORS (4)
ABSTRACT
Abstract Task scheduling (TS) and multi-agent-path-finding (MAPF) are two cruxes of pickup-and-delivery in automated warehouses. In this paper, the optimized simultaneously. Firstly, system model, task path model established, respectively. Then, a algorithm based on enhanced HEFT, heuristic MAPF TS- proposed to solve combinatorial optimization problem. EHEFT, novel rank priority rule is used determine sequencing allocation. algorithm, CBS with rules designed for search. Subsequently, TS-MAPF which combines EHEFT proposed. Finally, algorithms tested separately against relevant typical at different scales. The experimental results indicate that exhibited good performance.
SUPPLEMENTAL MATERIAL
Coming soon ....
REFERENCES (22)
CITATIONS (11)
EXTERNAL LINKS
PlumX Metrics
RECOMMENDATIONS
FAIR ASSESSMENT
Coming soon ....
JUPYTER LAB
Coming soon ....