Dynamic Path Planning Scheme for OHT in AMHS Based on Map Information Double Deep Q-Network

被引:0
|
作者
Ao, Qi [1 ,2 ]
Zhou, Yue [1 ]
Guo, Wei [3 ]
Wang, Wenguang [2 ]
Ye, Ying [2 ]
机构
[1] Shanghai Ocean Univ, Sch Engn, Shanghai 201306, Peoples R China
[2] Shanghai GoNa Semicond Technol Co Ltd, Shanghai 201306, Peoples R China
[3] Chinese Acad Sci, Inst Deep Sea Sci & Engn, Sanya 572000, Peoples R China
关键词
deep reinforcement learning; path planning; AMHS; double deep Q-network; OHT; MATERIAL HANDLING SYSTEMS; BLOCKING;
D O I
10.3390/electronics13224385
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
AMHSs (Automated Material Handling Systems) are widely used in major Fabs (semiconductor fabrication plants). The OHT in an AMHS is responsible for handling the FOUP (Front Opening Unified Pod) within the Fabs. Due to the unidirectional track, the movement path of the OHT aims to avoid congested areas caused by operations or malfunctions as much as possible, to improve the overall FOUP handling efficiency. To do so, we propose a dynamic path planning method, MI-DDQN (Map Information Double Deep Q-Network), driven by deep reinforcement learning and based on map information. Firstly, we design and establish a map information state space model based on the core elements of the OHT path planning in the AMHS. Then, we design an OHT motion simulator to simulate the position coordinate transformation of the OHT, providing real-time coordinate update data for the OHT during the algorithm training process. We design a deep reinforcement learning algorithm structure based on map information model and a convolutional neural network model structure and use the algorithm to train the network model. Finally, the designed task generation module and OHT motion simulator are used to randomly generate the starting position and task position of the OHT during the training process to enhance the richness of the data. The addition of a "fault" OHT verifies the method's ability to plan routes in complex road conditions such as congestion that may occur at any time.
引用
收藏
页数:17
相关论文
共 50 条
  • [41] WPT-enabled Multi-UAV Path Planning for Disaster Management Deep Q-Network
    Merabet, Adel
    Lakas, Abderrahmane
    Belkacem, Abdelkader Nasreddine
    2023 INTERNATIONAL WIRELESS COMMUNICATIONS AND MOBILE COMPUTING, IWCMC, 2023, : 1672 - 1678
  • [42] Double Deep Q-Network by Fusing Contrastive Predictive Coding
    Liu, Jianfeng
    Pu, Jiexin
    Sun, Lifan
    Computer Engineering and Applications, 2023, 59 (06) : 162 - 170
  • [43] Stock trading rule discovery with double deep Q-network
    Shi, Yong
    Li, Wei
    Zhu, Luyao
    Guo, Kun
    Cambria, Erik
    APPLIED SOFT COMPUTING, 2021, 107
  • [44] A Stealth-Distance Dynamic Weight Deep Q-Network Algorithm for Three-Dimensional Path Planning of Unmanned Aerial Helicopter
    Wang, Zeyang
    Huang, Jun
    Yi, Mingxu
    AEROSPACE, 2023, 10 (08)
  • [45] USVs Path Planning for Maritime Search and Rescue Based on POS-DQN: Probability of Success-Deep Q-Network
    Liu, Lu
    Shan, Qihe
    Xu, Qi
    JOURNAL OF MARINE SCIENCE AND ENGINEERING, 2024, 12 (07)
  • [46] Reinforced Event-Driven Evolutionary Algorithm Based on Double Deep Q-network
    Zhou, Tianwei
    Zhang, Wenwen
    Lu, Junrui
    He, Pengcheng
    Yao, Keqin
    ADVANCES IN SWARM INTELLIGENCE, ICSI 2022, PT I, 2022, : 294 - 304
  • [47] Automatic Lane Change Decision Model Based on Dueling Double Deep Q-network
    Zhang X.-F.
    Wang Z.-Y.
    Dongbei Daxue Xuebao/Journal of Northeastern University, 2023, 44 (10): : 1369 - 1376
  • [48] Droplet Routing Based on Double Deep Q-Network Algorithm for Digital Microfluidic Biochips
    Rajesh, Kolluri
    Pyne, Sumanta
    JOURNAL OF CIRCUITS SYSTEMS AND COMPUTERS, 2022, 31 (17)
  • [49] Double Deep Q-Network Decoder Based on EEG Brain-Computer Interface
    REN Min
    XU Renyu
    ZHU Ting
    ZTECommunications, 2023, 21 (03) : 3 - 10
  • [50] Multifunctional Radar Cognitive Jamming Decision Based on Dueling Double Deep Q-Network
    Feng, Lu-Wei
    Liu, Song-Tao
    Xu, Hua-Zhi
    IEEE ACCESS, 2022, 10 : 112150 - 112157