Scheduling and routing of autonomous moving objects on a mesh topology

Chiew, Kevin (2012) Scheduling and routing of autonomous moving objects on a mesh topology. Operational Research, 12 (3). pp. 385-397. ISSN 1109-2858

Full text not available from this repository. (Request a copy)
Official URL: http://dx.doi.org/10.1007/s12351-010-0093-z

Abstract

Autonomous moving objects (AMOs), such as automated guided vehicles (AGVs) and autonomous robots, have been widely used in industry for decades. In an intelligent transport system with a great number of AMOs involved, it is desirable to maintain a smooth traffic flow of AMOs without congestion or deadlocks. Continuing our previous study, in this paper we propose a new algorithm for concurrent scheduling and routing of a great number (i.e., 4n 2) of AMOs on an n × n mesh topology of path network. As a significant improvement compared with the previous algorithm, this new algorithm achieves 3n concurrent rectilinear steps of routing for all 4n 2 AMOs, while no congestion or deadlocks arise from them when all AMOs are moving around on the mesh topology. The theoretical analysis and calculations of the algorithm are verified by randomly generated data in our experiments.

Item Type: Article
Uncontrolled Keywords: Scheduling and routing, autonomous moving object, mesh topology
Subjects: G400 Computer Science
G900 Others in Mathematical and Computing Sciences
Department: Faculties > Engineering and Environment > Computer and Information Sciences
Depositing User: Ay Okpokam
Date Deposited: 25 Jun 2013 10:29
Last Modified: 10 Aug 2015 11:15
URI: http://nrl.northumbria.ac.uk/id/eprint/13111

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics


Policies: NRL Policies | NRL University Deposit Policy | NRL Deposit Licence