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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Off-line AGV routing on the 2D mesh topology with partial permutation


    Contributors:


    Publication date :

    2003-01-01


    Size :

    372963 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Off-Line AGV Routing on the 2D Mesh Topology with Partial Permutation

    Zeng, J. / Hsu, W.-J. / IEEE | British Library Conference Proceedings | 2003


    Routing AGVs on a mesh-like path topology

    Ling Qiu, / Wen-Jing Hsu, | IEEE | 2000


    Routing AGVs on a Mesh-like Path Topology

    Qiu, L. / Hsu, W. / IEEE | British Library Conference Proceedings | 2000


    2D MESH TOPOLOGY USING ROUTING ALGORITHMS FOR NOC ARCHITECTURE

    Ashwini M. Dahule1 / Prof- P.R. Indurkar2 | BASE | 2016

    Free access

    PLI-Aware Routing in Regenerated Mesh Topology Optical Networks

    Politi, C. / Anagnostopoulos, V. / Stavdas, A. | British Library Online Contents | 2012