Routing AGVs by sorting

被引：0

作者：

Qiu, L ^{[1
]}

Hsu, WJ ^{[1
]}

机构：

[1] Nanyang Technol Univ, Sch Appl Sci, Ctr Adv Informat Syst, Singapore 639798, Singapore

来源：

PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-V | 2000年

关键词：

Automated Guided Vehicle; routing; sorting;

D O I：

暂无

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

Automated Guided Vehicles (or AGVs for short) are becoming one of the important options in container terminals for transferring containers. As one of the enabling technologies, scheduling and routing of AGVs have attracted considerable attention in the past decade. Many algorithms for scheduling and routing of AGVs have been proposed. The paper presents a provably efficient algorithm for routing AGVs on a mesh-like path topology. Our strategy guarantees no conflicts or deadlocks amongst AGVs in the course of moving towards their destinations; a high degree of concurrency can be achieved during our routing process.

引用

页码：1465 / 1470

页数：6