In a hierarchical road network, all roads can be classified into two groups according to their attributes, such as their speed limit and the number of lanes. By splitting the whole network into high-level and low-level subnetworks, the size of the road network to be searched can be reduced, and more human-oriented paths can be obtained. In this paper, we define a convenient path in the hierarchical road network and propose an algorithm for finding that path. The proposed algorithm produces a convenient and approximately shortest path with little computational effort by reducing the number of nodes to be considered. The difference between the length of the paths produced by the proposed algorithm and by existing algorithms and that of the shortest path of the whole network is discussed. Some experimental results are given to show the efficiency of the proposed algorithm.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Finding a path in the hierarchical road networks


    Contributors:


    Publication date :

    2001-01-01


    Size :

    714251 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Finding a Path in the Hierarchical Road Networks

    Park, C. K. / Sung, K. / Doh, S. et al. | British Library Conference Proceedings | 2001


    Hierarchical path-finding for Navigation Meshes (HNA*)

    Pelechano Gómez, Núria / Fuentes, Carlos | BASE | 2016

    Free access


    Optimizing Road Networks: A Graph-Based Analysis with Path-finding and Learning Algorithms

    P, Muthuvel / G, Pandiyan / S, Manickam et al. | Springer Verlag | 2025


    Optimizing Road Networks: A Graph-Based Analysis with Path-finding and Learning Algorithms

    P, Muthuvel / G, Pandiyan / S, Manickam et al. | Springer Verlag | 2025