In this paper, we consider the routing issue for the AGV system in the large scalable flexible manufacturing system (LSFMS). After we study the existing mature techniques in the packet routing and analyze the differences between the AGV routing and packet routing model, especially on the mesh topology, we propose an off-line algorithm for AGV routing on the 2D mesh layout with partial permutation. The running time of our routing algorithm is 2n + o(n) steps for an n /spl times/ n mesh layout, which is almost optimal in the worst case.
Off-line AGV routing on the 2D mesh topology with partial permutation
2003-01-01
372963 byte
Conference paper
Electronic Resource
English
Off-Line AGV Routing on the 2D Mesh Topology with Partial Permutation
British Library Conference Proceedings | 2003
|Routing AGVs on a mesh-like path topology
IEEE | 2000
|Routing AGVs on a Mesh-like Path Topology
British Library Conference Proceedings | 2000
|PLI-Aware Routing in Regenerated Mesh Topology Optical Networks
British Library Online Contents | 2012
|