.png){kind=icon}
.png){kind=icon}
Return
An Online Multi-Agent Path Finding Algorithm for Large-Scale Puzzle-based Conveyor System
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2025.130057.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
• This paper tackles the sorting problem on the Puzzle-based Conveyor System. • It presents a fast Online Multi-agent path finding Algorithm (OMA). • OMA boosts package throughput in real-time logistics by up to 26%. • OMA uses agent grouping and windows planning to reduce runtime by up to 20%. • OMA demonstrates scalability on large grids with hundreds of simultaneous agents.
Journal
IF:
7.5
Papers:
2.9W
Citations:
10.2W