Finding least-cost paths across a continuous raster surface with discrete vector networks |
| |
| Authors: | Yosoon Choi Jeong-Gi Um Myong-Ho Park |
| |
| Institution: | 1. Department of Energy Resources Engineering, Pukyong National University, Busan 608-737, South Koreaenergy@pknu.ac.kr yspower7@gmail.com;3. Department of Energy Resources Engineering, Pukyong National University, Busan 608-737, South Korea;4. E&5. P Technology Institute, Korea National Oil Corporation, Anyang 431-711, South Korea |
| |
| Abstract: | The problem of finding the least-cost path from a source point to a destination point can be dealt with by routing across a continuous surface or routing along a discrete network. The solutions within these two contexts are linked to the use of a raster- or a vector-based least-cost path algorithm. This study presents a technique which integrates raster- and vector-based least-cost path algorithms for determining the least-cost path across a continuous raster surface with discrete vector networks. The technique incorporates ancillary vector data sets that are required to examine the travel cost at each link, connections between nodes, and the representation of intersecting links in the discrete vector network into raster-based least-cost path analysis. The integrated technique presented here is applicable to all-terrain vehicle navigation where a continuous raster surface and discrete vector networks need to be considered simultaneously in order to find least-cost paths. This paper describes the concept behind, and details of, the integrated technique. Applications of the technique with synthetic and real-world data sets are also presented. They provide proof that the technique is effective in finding least-cost paths across a continuous raster surface with discrete vector networks. |
| |
| Keywords: | least-cost path route planning network analysis navigation multimodal transport |
|
|
