Abstract
This paper proposes to adapt parallel sorting/message routing algorithms to route Automated Guided Vehicles (or AGVs for short) on mesh-like 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.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Qiu, L. and Hsu, W.-J., Scheduling and Routing Algorithms for AGVs: a Survey. Technical report: CAIS-TR-99-26, Centre for Adv. Info. Sys., Schl. of Applied Science., Nanyang Tech. Univ., Singapore, Oct 1999. Available at http://www.cais.ntu.edu.sg:8000/.
Qiu, L. and Hsu, W.-J., Adapting Sorting Algorithms for Routing AGVs on a Mesh-like Path Topology. Tech. report: CAIS-TR-00-28, Centre for Adv. Info. Sys., Schl. of Applied Sci., Nanyang Tech. Univ., S’pore, Feb 2000. Available at http://www.cais.ntu.edu.sg:8000/.
Qiu, L. and Hsu, W.-J., Conflict-free AGV Routing in a Bi-directional Path Layout. Proc. of 5 th Int’l Conf. on Comput. Integrated Manu., Singapore, Mar 2000, pp. 392–403.
Qiu, L. and Hsu, W.-J., Routing AGVs by Sorting. Accepted for 2000 Int’l Conf. on Para. andDist. Processing Tech. and App. (PDPTA’ 2000), Las Vegas, USA, Jun 26–29, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Qiu, L., Hsu, WJ. (2000). Algorithms for Routing AGVs on a Mesh Topology. In: Bode, A., Ludwig, T., Karl, W., Wismüller, R. (eds) Euro-Par 2000 Parallel Processing. Euro-Par 2000. Lecture Notes in Computer Science, vol 1900. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44520-X_82
Download citation
DOI: https://doi.org/10.1007/3-540-44520-X_82
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67956-1
Online ISBN: 978-3-540-44520-3
eBook Packages: Springer Book Archive