| 障碍物存在的最短路径算法及其在车载导航中的应用 |
| |
| 引用本文： | 马霞,王怀平,郭先春. 障碍物存在的最短路径算法及其在车载导航中的应用[J]. 物联网技术, 2013, 0(12): 13-15 |
| |
| 作者姓名： | 马霞 王怀平 郭先春 |
| |
| 作者单位： | 东华理工大学 |
| |
| 基金项目： | 东华理工大学校长基金项目资助(DHXK1116、DHXH1044);广州大学珠江三角洲水质安全与保护省部共建教育部重点实验室项目资助(GZ201104) |
| |
| 摘 要： | 车载导航系统中的动态路线选择是其必备功能之一，文中分析了经典Dijkstra算法存在的不足，并在此基础上，采用优化的邻接矩阵存储结构，讨论了有障碍物存在情况下的最短路径问题。同时用Vc＋＋与Mapx实现了有障碍物存在的动态最短路径算法。实验结果表明，该算法能有效求出有障碍物存在时的最短路径。
|
| 关 键 词： | 最短路径 障碍物 车载导航 改进算法 |
The obstacles-existed shortest path algorithm and the application in vehicle navigation |
| |
| MA Xia;WANG Huai-ping;GUO Xian-chun. The obstacles-existed shortest path algorithm and the application in vehicle navigation[J]. Internet of things technologies, 2013, 0(12): 13-15 |
| |
| Authors: | MA Xia WANG Huai-ping GUO Xian-chun |
| |
| Affiliation: | MA Xia;WANG Huai-ping;GUO Xian-chun;East China Institute of Technology; |
| |
| Abstract: | Dynamic route choice is one of the essential functions in n car navigation system. The deficiencies of classic Dijkstra algorithm are analyzed, and on this basis, the problems of obstacles-existed shortest path are discussed by using optimized adjacency matrix storage structure. The dynamic shortest path algorithm with the obstacles existing is realized by using VC＋＋ and MapX. Experimental results show that the proposed algorithm can effectively work out the shortest path with the obstacles existing. |
| |
| Keywords: | the shortest path obstacles car navigation improved algorithm |
| 本文献已被 CNKI 维普 等数据库收录！ |
