栅格地形的最优路径分析  

Least-cost Path Analysis in Raster Terrains

作　　者：鲁敏[1] 张金芳[2] 

机构地区：[1]中南财经政法大学信息学院,武汉市南湖南路1号430073 [2]中国科学院软件研究所综合信息系统技术国家重点实验室,北京市中关村南四街4号100190

出　　处：《武汉大学学报（信息科学版）》2010年第1期59-63,共5页Geomatics and Information Science of Wuhan University

基　　金：中南财经政法大学振兴工程科研基金资助项目

摘　　要：将栅格地形根据不同的邻域结构形成稀疏栅格网络和稠密栅格网络,分析了稀疏网络中最优路径问题的建模和基于Dijkstra算法的求解方法,以及稠密网络中最优路径问题的建模和基于模拟退火算法的求解方法。比较了这两种方法求解结果的准确性和效率的差异,发现基于稀疏网络的Dijkstra算法更适合于栅格地形的最优路径问题的求解。The raster terrains can be deformed to sparse networks and dense networks according to different neighborhood structures. The least cost path problems in sparse networks are analyzed, modeled and resolved using the Dijkstra algorithm. Simultaneously the ones in dense networks are analyzed, modeled and resolved by simulated annealing algorithm. The accuracy and efficiency of the results got from the experiments of the two methods were compared and analyzed thoroughly. And the Dijkstra algorithm is proved to be more suitable for least-cost path planning in raster terrains.

关 键 词：栅格 最优路径 DIJKSTRA算法 模拟退火算法 

分 类 号：P208[天文地球—地图制图学与地理信息工程]