In a hierarchical road network, all roads can be classified into two groups according to their attributes such as their speed limit and number of lane. By splitting the whole network into the 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 work, we define a convenient path in the hierarchical road network and propose an algorithm for finding the path. The proposed algorithm produces a convenient and approximately shortest path with less computational efforts by reducing the number of nodes t o be considered. The differences of the length of the paths produced by the proposed algorithm and existing algorithms and that of the shortest path of the whole network are discussed. Some experimental results are given to show the efficiency of the proposed algorithm.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.