TY - JOUR
T1 - Scheduling and routing of AMOs in an intelligent transport system
AU - Chiew, Kevin
AU - Shaowen, Qin
PY - 2009/7/14
Y1 - 2009/7/14
N2 - Autonomous moving objects (AMOs), such as automated guided vehicles (AGVs) and autonomous robots, have widely been used in the industry for decades. In an intelligent transport system with a great number of AMOs involved, it is important to eliminate potential congestion and deadlocks among AMOs to maintain a well-organized traffic flow. In this paper, we propose an algorithm that adapts bitonic merge sort algorithm for concurrent scheduling and routing of a great number (i.e., 4n 2) of AMOs on an ntimesn mesh topology of path network without congestion or deadlocks among AMOs during their moves. The results are tested by experiments with randomly generated data and the comparison of a related model.
AB - Autonomous moving objects (AMOs), such as automated guided vehicles (AGVs) and autonomous robots, have widely been used in the industry for decades. In an intelligent transport system with a great number of AMOs involved, it is important to eliminate potential congestion and deadlocks among AMOs to maintain a well-organized traffic flow. In this paper, we propose an algorithm that adapts bitonic merge sort algorithm for concurrent scheduling and routing of a great number (i.e., 4n 2) of AMOs on an ntimesn mesh topology of path network without congestion or deadlocks among AMOs during their moves. The results are tested by experiments with randomly generated data and the comparison of a related model.
U2 - 10.1109/TITS.2009.2026449
DO - 10.1109/TITS.2009.2026449
M3 - Article
SN - 1524-9050
SN - 1558-0016
SN - 1941-1197
VL - 10
SP - 547
EP - 552
JO - IEEE Transactions on Intelligent Transportation Systems
JF - IEEE Transactions on Intelligent Transportation Systems
IS - 3
ER -
