基于GIS的路径规划算法研究与实现  

Research and realization of path planning algorithm based on GIS

作　　者：孙兰会[1] 成锋 陆愈实[1] 

机构地区：[1]中国地质大学工程学院,湖北武汉430074 [2]湖北省电力勘测设计院,湖北武汉430074

出　　处：《现代电子技术》2016年第5期101-104,109,共5页Modern Electronics Technique

摘　　要：路径规划问题是地理信息系统(GIS)研究领域中的关键内容之一,最短路径的寻找更是热点问题。在数据量较大时,传统前K条最短路径算法效率较低,且不能解决某些实际需求下规划K条差异较大的路径问题。在Dijkstra算法的基础上,引入有利度与重复度的概念,通过对路径结果重复度的检测以及由有利度的改变所引起的图的变化,循环寻找当前图中的最短路径,从而实现了多条差异路径的规划。在上述算法的基础上,对野外区域中带状区域的有利度及重复度进行控制,解决了传统前K条最短路径算法难以满足野外区域多条差异路径规划的问题。The path planning problem is one of the key contents in the research field of geographic information system （GIS）, in which the search of shortest path is the hot topic. The traditional K shortest path algorithm has low efficiency when the data size is vast, and can＇t solve the problem of K path with big difference for some actual requirements. On the basis of Di- jkstra algorithm, the concepts of favorability and repeatability are brought in. The shortest path of current graph is cyclically searched by detecting the repeatability of the path result and graph change caused by favorability variation to realize the plan- ning of multiple difference paths. The favorability and repeatability of the belt-shaped regions in the field region are controlled based on the above algorithm. The problem that the traditional K shortest path algorithm can＇t satisfy the multiple different paths planning in the field region was resolved.

关 键 词：路径规划 GIS 有利度 重复度 

分 类 号：TN911-34[电子电信—通信与信息系统] TM417[电子电信—信息与通信工程]