Translator Disclaimer
7 August 2007 An efficient distributed shortest path algorithm based on hierarchically structured topographical model
Author Affiliations +
Abstract
The route computation module is one of the most important functional blocks in a dynamic route guidance system. Although various algorithms exist for finding the shortest path, they are faced with the networks in the local server not distributed environment. We present an efficient distributed hierarchical routing algorithm that can find a near-optimal route and evaluate it on a large city road network which is composed of a lot of small networks which are placed on different servers. Solutions provided by this algorithm are compared with the stand-alone traditional hierarchical routing solutions to analyze the same and different points. We propose two novel yet simple heuristic to substantially improve the performance of this hierarchical routing algorithm with acceptable loss of accuracy. The improved distributed hierarchical routing algorithm has been found to be faster than a local A* algorithm.
© (2007) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Wei Guo, Xinyan Zhu, and Yi Liu "An efficient distributed shortest path algorithm based on hierarchically structured topographical model", Proc. SPIE 6754, Geoinformatics 2007: Geospatial Information Technology and Applications, 675407 (7 August 2007); https://doi.org/10.1117/12.764583
PROCEEDINGS
9 PAGES


SHARE
Advertisement
Advertisement
Back to Top