Abstract
In developing the infrastructure facilities such as irrigation canals and road networks, topography acts as a significant enabler or constraint. Contour maps and low resolution DEMs have been used by Irrigation engineers and planners to assess the canal routing options, which is time consuming and requires repeated evaluations of the potential paths. So, there is a need to develop robust path planning algorithms, including least cost routing, that takes the topographic and engineering constraints while providing potential canal routing paths. Some recent works have attempted to develop algorithms on synthetic data sets but have not been scaled up on high-resolution data sets, limiting their practical use. This work develops a generic algorithm to determine the least-cost flow path between two geo-locations, given the grid-based Digital Elevation Models (DEMs) and a unit cost of construction per length. From the numerous paths that are possible between the two points in any given topography, a distinct least-cost path is identified. The proposed approach is evaluated by computing canal routing paths over publicly available real-world datasets across two different resolutions of 1Km and 90-meter from different sources for Indian terrains. This is then compared against a global reference real-world dataset, Digital Chart of the World (DCW) at 1Km at a grid cell level. The results across multiple stretches shows an average accuracy of 82.09% as measured based on the path overlap against the DCW dataset, proving that the proposed algorithm can be useful in practice.