Centre de documentation
scientifique

GIS-based route planning in landslide-prone areas / A.K. Saha in International journal of geographical information science IJGIS, vol 19 n° 10 (november 2005)  

Public [article]  inInternational journal of geographical information science IJGIS > vol 19 n° 10 (november 2005) . - pp 1149 - 1175 Titre : GIS-based route planning in landslide-prone areas Type de document : Article/Communication Auteurs : A.K. Saha, Auteur ; M.K. Arora, Auteur ; et al., Auteur Année de publication : 2005 Article en page(s) : pp 1149 - 1175 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Applications SIG [Termes IGN] couche thématique [Termes IGN] coût [Termes IGN] effondrement de terrain [Termes IGN] Himalaya [Termes IGN] planification [Termes IGN] prévention des risques [Termes IGN] réseau routier [Termes IGN] risque naturel [Termes IGN] système d'information géographique [Termes IGN] système expert [Termes IGN] utilisation du sol Résumé : (Auteur) Many parts of the world with young mountain chains, such as the Himalayas, are highly susceptible to landslides. Due to general ruggedness and steep slopes, roads provide the only way of transportation and connectivity in such terrains. Generally, landslide hazards are overlooked during route planning. In this study, in a test area in the Himalayas, various thematic layers, viz. landslide distribution, landslide hazard zonation, landuse/landcover, drainage order and lithology are generated and integrated using Remote Sensing GIS techniques. The integrated data layer in raster form has been called a 'thematic cost map' and provides an estimate of the cost of route development and maintenance. The relative cost assignment is based on experts' knowledge. Route planning is based on neighbourhood analysis to find various movement possibilities from a pixel to its immediate neighbours. A number of patterns such as those analogous to movements in chess games have been considered. Two new neighbourhood patterns, named here Knight31 and Knight32, have been conceived in addition to commonly used Rook, Bishop and Knight patterns. The neighbourhood movement cost for moving from one pixel to a connected neighbour has been calculated for a 7 x 7 pixel window considering distance, gradient cost and thematic cost. Dijkstra's algorithm has been applied to compute the least-cost route between source and destination points. A few examples are presented to show the utility of this approach for a landslide-safe automatic route planning for a highly rugged hilly terrain. Numéro de notice : A2005-504 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1080/13658810500105887 En ligne : https://doi.org/10.1080/13658810500105887 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=27640 [article]

Exemplaires(2)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
079-05091	RAB	Revue	Centre de documentation	En réserve L003	Disponible
079-05092	RAB	Revue	Centre de documentation	En réserve L003	Disponible