Research on AGV task assignment and path planning in robotic mobile fulfilment systems

With the development of the e-commerce industry, the supply chain plays a significant role. The increasing demand needs more efficient and more effective service. As the key component of the online supply chain, the operation of the warehouse greatly affects the speed of order response. More and mor...

Full description

Saved in:
Bibliographic Details
Main Author: Huang, Linjie
Other Authors: Chen Chun-Hsien
Format: Thesis-Master by Coursework
Language:English
Published: Nanyang Technological University 2024
Subjects:
Online Access:https://hdl.handle.net/10356/173601
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
id sg-ntu-dr.10356-173601
record_format dspace
spelling sg-ntu-dr.10356-1736012024-02-24T16:52:23Z Research on AGV task assignment and path planning in robotic mobile fulfilment systems Huang, Linjie Chen Chun-Hsien School of Mechanical and Aerospace Engineering mchchen@ntu.edu.sg Engineering With the development of the e-commerce industry, the supply chain plays a significant role. The increasing demand needs more efficient and more effective service. As the key component of the online supply chain, the operation of the warehouse greatly affects the speed of order response. More and more e-commerce enterprises apply automation systems in the warehouse to improve order picking efficiency. The Robotic Mobile Fulfilment System (RMFS) is one of the systems which is widely used to solve the problem. It uses Automated Guided Vehicles (AGVs) to transport the items. To further improve the productivity of the warehouse, how to manage the operation of the AGVs in RMFS is of great importance. This dissertation conducts research on the AGV task assignment and path planning problem in RMFS. For the task assignment, this dissertation proposed 4 strategies based on different assignment time and different assignment principles. For the path planning part, the A* algorithm is improved by grading the AGVs by the loading state and planning the path step by step to avoid conflicts between them. Then, the task assignment strategies and the improved A* algorithm are implemented by MATLAB to deal with the tasks in an RMFS warehouse. The conflict-free paths are successfully planned for AGVs. In the end, a sensitive analysis is made to compare the impact of different task volumes, different warehouse scales and different AGV numbers on warehouse operation time which could provide managerial insights for the enterprises in relevant aspects. The improved A* algorithm helps find the path more dynamically and the assignment strategies are compared and chosen. This dissertation provides a reference for the development of the E-commerce warehouse. Master's degree 2024-02-19T02:10:20Z 2024-02-19T02:10:20Z 2024 Thesis-Master by Coursework Huang, L. (2024). Research on AGV task assignment and path planning in robotic mobile fulfilment systems. Master's thesis, Nanyang Technological University, Singapore. https://hdl.handle.net/10356/173601 https://hdl.handle.net/10356/173601 en application/pdf Nanyang Technological University
institution Nanyang Technological University
building NTU Library
continent Asia
country Singapore
Singapore
content_provider NTU Library
collection DR-NTU
language English
topic Engineering
spellingShingle Engineering
Huang, Linjie
Research on AGV task assignment and path planning in robotic mobile fulfilment systems
description With the development of the e-commerce industry, the supply chain plays a significant role. The increasing demand needs more efficient and more effective service. As the key component of the online supply chain, the operation of the warehouse greatly affects the speed of order response. More and more e-commerce enterprises apply automation systems in the warehouse to improve order picking efficiency. The Robotic Mobile Fulfilment System (RMFS) is one of the systems which is widely used to solve the problem. It uses Automated Guided Vehicles (AGVs) to transport the items. To further improve the productivity of the warehouse, how to manage the operation of the AGVs in RMFS is of great importance. This dissertation conducts research on the AGV task assignment and path planning problem in RMFS. For the task assignment, this dissertation proposed 4 strategies based on different assignment time and different assignment principles. For the path planning part, the A* algorithm is improved by grading the AGVs by the loading state and planning the path step by step to avoid conflicts between them. Then, the task assignment strategies and the improved A* algorithm are implemented by MATLAB to deal with the tasks in an RMFS warehouse. The conflict-free paths are successfully planned for AGVs. In the end, a sensitive analysis is made to compare the impact of different task volumes, different warehouse scales and different AGV numbers on warehouse operation time which could provide managerial insights for the enterprises in relevant aspects. The improved A* algorithm helps find the path more dynamically and the assignment strategies are compared and chosen. This dissertation provides a reference for the development of the E-commerce warehouse.
author2 Chen Chun-Hsien
author_facet Chen Chun-Hsien
Huang, Linjie
format Thesis-Master by Coursework
author Huang, Linjie
author_sort Huang, Linjie
title Research on AGV task assignment and path planning in robotic mobile fulfilment systems
title_short Research on AGV task assignment and path planning in robotic mobile fulfilment systems
title_full Research on AGV task assignment and path planning in robotic mobile fulfilment systems
title_fullStr Research on AGV task assignment and path planning in robotic mobile fulfilment systems
title_full_unstemmed Research on AGV task assignment and path planning in robotic mobile fulfilment systems
title_sort research on agv task assignment and path planning in robotic mobile fulfilment systems
publisher Nanyang Technological University
publishDate 2024
url https://hdl.handle.net/10356/173601
_version_ 1794549443450634240