Using the hierarchical pathfinding A∗ algorithm in GIS to find paths through rasters with nonuniform traversal cost

13Citations
Citations of this article
27Readers
Mendeley users who have this article in their library.

Abstract

A fair amount of research has been carried out on pathfinding problems in the context of transportation networks, whereas pathfinding in off-network space has received far less interest. In geographic information systems (GIS), the latter is usually associated with the cost surface method, which allows optimum paths to be calculated through rasters in which the value of each cell depicts the cost of traversal through that cell. One of the problems with this method is computational expense, which may be very high with large rasters. In this study, a pathfinding method called Hierarchical Pathfinding A(HPA), based on an abstraction strategy, is investigated as an alternative to the traditional approach. The aim of this study is to enhance the method to make it more suitable for calculating paths over cost rasters with nonuniform traversal cost. The method is implemented in GIS and tested with actual data. The results indicate that by taking into account the information embedded in the cost raster, paths of relatively good quality can be calculated while effecting significant savings in computational effort compared to the traditional, nonhierarchical approach..

Cite

CITATION STYLE

APA

Antikainen, H. (2013). Using the hierarchical pathfinding A∗ algorithm in GIS to find paths through rasters with nonuniform traversal cost. ISPRS International Journal of Geo-Information, 2(4), 996–1014. https://doi.org/10.3390/ijgi2040996

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free