Skip to main content
Conference ProceedingsOPEN ACCESS

Algorithms for routing AGVs on a mesh topology

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2000) 1900 595-599
DOI: 10.1007/3-540-44520-x_82
8Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper proposes to adapt parallel sorting/message routing algorithms to route Automated Guided Vehicles (or AGVs for short) on meshlike path topologies. Our strategy guarantees that no conflicts will occur among AGVs when moving towards their destinations; a high degree of concurrency can be achieved during our routing process.

Cite

CITATION STYLE

APA

Qiu, L., & Hsu, W. J. (2000). Algorithms for routing AGVs on a mesh topology. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1900, pp. 595–599). Springer Verlag. https://doi.org/10.1007/3-540-44520-x_82

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free