Qiuling Tang, Wanfeng Dou

An Effective Method for Computing the Least-Cost Path Using a Multi-Resolution Raster Cost Surface Model

  • Earth and Planetary Sciences (miscellaneous)
  • Computers in Earth Sciences
  • Geography, Planning and Development

Calculating the least-cost path (LCP) is a fundamental operation in raster-based geographic information systems (GIS). The LCP is applied to raster cost surfaces, in which it determines the most cost-effective path. Increasing the raster resolution results in a longer computation time to obtain LCP. This paper proposes a method for calculating the LCP using a multi-resolution raster cost surface model to enhance computational performance for large-scale grids. The original raster cost surface is progressively downsampled to generate grids of decreasing resolutions. Subsequently, the path is determined on the low-resolution raster. By performing operations such as filtering directional points and mapping path points, the final path on the high-resolution raster can be obtained. The method enables a parallel computation of paths. Therefore, it significantly improves the efficiency for synthetic raster cost surfaces with continuous or discrete characteristics, as well as for raster cost surfaces generated from real terrain datasets, while also providing an end-to-end path output. The experiments show that 80% of the results are very close to the original LCP, and the accuracy of the remaining paths falls within an acceptable range. At the same time, our method greatly improves the efficiency of path solving on a large-scale raster, fulfilling practical application requirements.

Need a simple solution for managing your BibTeX entries? Explore CiteDrive!

  • Web-based, modern reference management
  • Collaborate and share with fellow researchers
  • Integration with Overleaf
  • Comprehensive BibTeX/BibLaTeX support
  • Save articles and websites directly from your browser
  • Search for new articles from a database of tens of millions of references
Try out CiteDrive

More from our Archive