Machine Learning and Digital Twin-Based Path Planning for AGVs at Automated Container Terminals

Author:

Gao Yinping12,Chen Chun-Hsien2,Chang Daofang1,Chen Songlin2,Song Xue Ting2

Affiliation:

1. Institute of Logistics Science & Engineering, Shanghai Maritime University, 1550 Haigang Avenue, 201306 Shanghai, China

2. School of Mechanical & Aerospace Engineering, Nanyang Technological University, 50 Nanyang Avenue, 639798, Singapore

Abstract

The complex and dynamic environment in an automated container terminal (ACT) increases the difficulty of path planning, especially for automated guided vehicles (AGVs). Digital twin is an essential means of characterizing complex production systems as the physical objects can be synchronized in the virtual space. Machine learning is also a popular way to solve path planning problems. This study combines digital twin and machine learning to tackle AGV path planning problems in the time-changing operation environment. A digital twin-based AGV scheduling approach is developed to obtain the real-time data from the physical ACT. Based on the information of the dynamic factors obtained, a mathematical model is formulated to minimize the transportation time of AGVs. Subsequently, the path planning schemes solved by machine learning are used asinput to the virtual ACT for validation and optimization. The optimized solution is further compared to a common path plan algorithm without applying digital twin. The experimental results show the superiority of the proposed method, which can provide better decision support for ACT operation.

Publisher

IOS Press

Cited by 2 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3