Heuristic shortest path algorithm in qualitative spatial representation

The qualitative spatial representation and the shortest path are the important issues in many research areas. This paper first proposes a qualitative spatial representation method. Specifically, the spatial adjacent relationship in Voronoi diagram is defined, and further is used as the standard for the decomposition of space, and then space can be represented qualitatively. Second, based on the qualitative spatial representation proposed in this paper, a heuristic function is defined, and then a heuristic algorithm for the shortest path is designed and implemented. Finally, experiments have been conducted and results show that (1) the qualitative spatial representation method proposed in this paper is feasible, and (2) compared with Dijkstra shortest path algorithm, the proposed heuristic shortest path algorithm is more efficient. 1553-9105/Copyright © 2014 Binary Information Press