Geometry Considerations in the Routing of Automated Guided Vehicles

摘要

Most research in the routing of AGVs assumes that in relation to the rest of thenetwork the AGV can be represented as a point. In this paper we consider the case where this assumption is violated either because the loads carried are very large or because the AGV itself is relatively large. We use a configuration space approach for local path planning and a labeling algorithm for global planning of routes. The presence of guidepaths induces the local planning problem to a shortest path problem with time windows. We also present computational experience with the algorithm on randomly generated test problems. The results indicate that the algorithm is computationally efficient.