Scheduling and routing of AMOs in an intelligent transport system

Kevin Chiew; Qin Shaowen

doi:10.1109/TITS.2009.2026449

Scheduling and routing of AMOs in an intelligent transport system

Kevin Chiew, Qin Shaowen

Northumbria University

Research output: Contribution to journal › Article › peer-review

8 Citations (Scopus)

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., 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.

Original language	English
Pages (from-to)	547-552
Journal	IEEE Transactions on Intelligent Transportation Systems
Volume	10
Issue number	3
DOIs	https://doi.org/10.1109/TITS.2009.2026449
Publication status	Published - 14 Jul 2009

Access to Document

10.1109/TITS.2009.2026449

Cite this

@article{df586fdbeb504f67a7e882f07d736eb0,

title = "Scheduling and routing of AMOs in an intelligent transport system",

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., 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.",

author = "Kevin Chiew and Qin Shaowen",

year = "2009",

month = jul,

day = "14",

doi = "10.1109/TITS.2009.2026449",

language = "English",

volume = "10",

pages = "547--552",

journal = "IEEE Transactions on Intelligent Transportation Systems",

issn = "1524-9050",

publisher = "IEEE",

number = "3",

}

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

VL - 10

SP - 547

EP - 552

JO - IEEE Transactions on Intelligent Transportation Systems

JF - IEEE Transactions on Intelligent Transportation Systems

SN - 1524-9050

IS - 3

ER -

Scheduling and routing of AMOs in an intelligent transport system

Abstract

Access to Document

Fingerprint

Cite this