A method for finding a least-cost wide path in raster space
2016 (English)In: International Journal of Geographical Information Science, ISSN 1365-8816, E-ISSN 1365-8824, Vol. 30, no 8, 1469-1485 p.Article in journal (Refereed) PublishedText
Given a grid of cells each having an associated cost value, a raster version of the least-cost path problem seeks a sequence of cells connecting two specified cells such that its total accumulated cost is minimized. Identifying least-cost paths is one of the most basic functions of raster-based geographic information systems. Existing algorithms are useful if the path width is assumed to be zero or negligible compared to the cell size. This assumption, however, may not be valid in many real-world applications ranging from wildlife corridor planning to highway alignment. This paper presents a method to solve a raster-based least-cost path problem whose solution is a path having a specified width in terms of Euclidean distance (rather than by number of cells). Assuming that all cell values are positive, it does so by transforming the given grid into a graph such that each node represents a neighborhood of a certain form determined by the specified path width, and each arc represents a possible transition from one neighborhood to another. An existing shortest path algorithm is then applied to the graph. This method is highly efficient, as the number of nodes in the transformed graph is not more than the number of cells in the given grid and decreases with the specified path width. However, a shortcoming of this method is the possibility of generating a self-intersecting path which occurs only when the given grid has an extremely skewed distribution of cost values.
Place, publisher, year, edition, pages
2016. Vol. 30, no 8, 1469-1485 p.
Least-cost path, wide path, site selection, raster data modeling
IdentifiersURN: urn:nbn:se:kth:diva-187858DOI: 10.1080/13658816.2015.1124435ISI: 000374902300001ScopusID: 2-s2.0-84950111608OAI: oai:DiVA.org:kth-187858DiVA: diva2:931742
QC 201605302016-05-302016-05-302016-05-30Bibliographically approved