现代电子技术Issue(5)：101-104,109,5.DOI:10.16652/j.issn.1004-373x.2016.05.024
基于GIS的路径规划算法研究与实现
Research and realization of path planning algorithm based on GIS
孙兰会 1成锋 2陆愈实1
作者信息
- 1. 中国地质大学 工程学院，湖北 武汉 430074
- 2. 湖北省电力勘测设计院，湖北 武汉 430074
- 折叠
摘要
Abstract
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/有利度/重复度Key words
path planning/GIS/favorability/repeatability分类
信息技术与安全科学引用本文复制引用
孙兰会,成锋,陆愈实..基于GIS的路径规划算法研究与实现[J].现代电子技术,2016,(5):101-104,109,5.
