| Dijkstra算法在嵌入式GIS中的优化实现 |
| |
| 引用本文： | 冯欣欣. Dijkstra算法在嵌入式GIS中的优化实现[J]. 北京理工大学学报, 2009, 29(10): 873-876 |
| |
| 作者姓名： | 冯欣欣 |
| |
| 作者单位： | 北京理工大学,机械与车辆学院,北京,100081 |
| |
| 摘 要： | 结合嵌入式系统的特点,对Dijkstra算法进行优化以保证其实时性. 通过对地图数据的分块,改进了直线优化方法. 通过对Dijkstra算法计算过程中已经计算过的结点数据进行临时标记、保存和排序,减少了重复运算. 改进后的寻优过程减少了参与运算的节点,保证了VxWorks系统下路径寻优的速度.
|
| 关 键 词： | Dijkstra算法 嵌入式导航 最短路径 |
| 收稿时间： | 2008-12-18 |
Efficient Implementation of Dijkstra Algorithm in Embedded GIS |
| |
| FENG Xin-xin. Efficient Implementation of Dijkstra Algorithm in Embedded GIS[J]. Journal of Beijing Institute of Technology(Natural Science Edition), 2009, 29(10): 873-876 |
| |
| Authors: | FENG Xin-xin |
| |
| Affiliation: | School of Mechanical Engineering, Beijing Institute of Technology, Beijing 100081, China |
| |
| Abstract: | Combining with the features of the embedded system, the efficient implementation of Dijkstra algorithm in embedded geographic information system is provided. The map data is divided into several regions. Then the Dijkstra algorithm is optimized by the partition information. By recording and arranging the nodes that has been searched before, most duplicated calculation is avoided. The nodes that are involved in the performance of data-processing is reduced, the real-time computation under VxWorks is ensured. |
| |
| Keywords: | Dijkstra algorithm embedded navigation system shortest path |
| 本文献已被 万方数据 等数据库收录！ |
| 点击此处可从《北京理工大学学报》浏览原始摘要信息 |
|
点击此处可从《北京理工大学学报》下载全文 |
|
