Congestion-aware dynamic routing for an overhead hoist transporter system using a graph convolutional gated recurrent unit
提出一种利用图卷积门控循环单元预测架空吊运运输系统轨道边旅行时间的算法，用于动态重规划路径以避免拥塞，提升半导体工厂自动化物料搬运系统的可扩展性和效率。
Overhead hoist transportors (OHT) that transport semiconductor wafers between tools/stockers, is a crucial component of an Automated Material Handling System (AMHS). As semiconductor fabrication plants (FABs) become larger, more OHT vehicles need to be operated. This necessitates the development of a scalable algorithm to effectively operate these OHTs and increase the productivity of the AMHS. This study proposes an algorithm that can predict the entire traveling times of the edges in an OHT rail network by utilizing past traffic information. The model first represents the OHT rail network and the dynamic traffic conditions using a graph. A sequence of graphs that represent the past traffic is then used as an input to produce a sequence of graphs that predicts the future traffic conditions as an output. Using the AutoMod simulator, we have shown that the proposed model scalably and effectively predicts the future edge-traveling time. We have also demonstrated that the predicted values can be used to reroute the OHTs optimally to avoid congestion.