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.
|IEEE Transactions on Intelligent Transportation Systems
|Published - 14 Jul 2009