| 基于OpenStreetMap最短路径算法的分析与实现 |
| |
| 引用本文： | 张英辉,张水平,张凤琴,王蓉.基于OpenStreetMap最短路径算法的分析与实现[J].计算机技术与发展,2013(11):37-41. |
| |
| 作者姓名： | 张英辉 张水平 张凤琴 王蓉 |
| |
| 作者单位： | 空军工程大学信息与导航学院,陕西西安710077 |
| |
| 基金项目： | 空装计划项目（KJ2012197） |
| |
| 摘 要： | 随着计算机网络技术和地理信息科学的发展，最短路径问题无论是在交通运输，还是在城市规划、物流管理、网络通讯等方面，都发挥了重要的作用。文中旨在阐述如何基于OSM运用Dijkstra算法计算两联通节点之间的最短路径。首先介绍了开放式OSM的特点以及地图数据文件中道路图像元素的数据结构；然后运用正则表达式算法从OSM数据中提取出交通道路信息，并选择合适的结构进行存储；最后通过将道路信息抽象成路径拓扑图，并以道路的地理距离作为路径权值，运用Dijkstra最短路径算法求解出两连通节点之间的最短路径。
|
| 关 键 词： | 最短路径算法 开放街道地图 地理信息系统 正则表达式 |
Analysis and Implementation of Shortest Path Algorithm Based on OpenStreetMap |
| |
| ZHANG Ying-hui,ZHANG Shui-ping,ZHANG Feng-qin,WANG Rong.Analysis and Implementation of Shortest Path Algorithm Based on OpenStreetMap[J].Computer Technology and Development,2013(11):37-41. |
| |
| Authors: | ZHANG Ying-hui ZHANG Shui-ping ZHANG Feng-qin WANG Rong |
| |
| Affiliation: | (College of Information and Navigation, University of Air Force Engineering, Xi＇an 710077, China) |
| |
| Abstract: | With the rapid development of computer network and GIS technology, the shortest path problem plays an important role in transportation, city planning,logistics management, network communication, etc. Focus on describing how to use Dijkstra algorithm to cal- culate the shortest path between two connected nodes based on OSM. Firstly introduce the characteristics of OSM and data structure of road image feature. Secondly ,extract road information by regular expression from OSM data file and store them in appropriate construction. Finally, form road topological diagram and takes the geographical distance as road weight, calculating the shortest path between two connected nodes by Dijkstra algorithm. |
| |
| Keywords: | shortest path algorithm OSM GIS regular expression |
| 本文献已被 维普 等数据库收录！ |
