Abstract
The rapid development of E-commerce has forced warehouse operations to develop towards a robotics-based system named Robotic Mobile Fulfillment System (RMFS), in which shortest path planning and conflict recognition play a vital role in enhancing the operational efficiency under multiple mobile robots movement. Compared to the traditional double-deep layout in Automatic Guided Vehicle (AGV) system, this paper proposes multi-deep based layouts in RMFS, including the modification of Flying-V, Fishbone and Chevron layouts. Under these circumstances, this paper further adopts the shortest path graph attention network in RMFS. This paper considers the Dijkstra algorithm as a baseline and compares it with Biased Cost Pathfinding methods, Anytime Repairing A-star and Flow-Annotation Re-planning methods. The shortest path graph attention network adoption in RMFS should enhance the overall operational efficiency and effectiveness under different layouts scenarios with different path planning methods.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
