Scheduling and routing of AMOs in an intelligent transport system

Authors:
Kevin Chiew;Shaowen Qinc
Affiliations:
School of Information Systems, Singapore Management University, Singapore;School of Computer Science, Engineering and Mathematics, Flinders University, Adelaide, SA, Australia
Venue:
IEEE Transactions on Intelligent Transportation Systems
Year:
2009

Citing 3
Cited 1

Conflict-free container routing in mesh yard layouts

Robotics and Autonomous Systems
Sorting networks and their applications

AFIPS '68 (Spring) Proceedings of the April 30--May 2, 1968, spring joint computer conference
Multi-agent robot systems as distributed autonomous systems

Advanced Engineering Informatics

Multistage off-line permutation packet routing on a mesh: an approach with elementary mathematics

Journal of Computer Science and Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

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., 4n2) of AMOs on an n × n 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.