首页 | 本学科首页   官方微博 | 高级检索  
     

一种综合高效的实时道路导航方案
引用本文:张春生.一种综合高效的实时道路导航方案[J].计算机工程与设计,2006,27(18):3391-3393.
作者姓名:张春生
作者单位:内蒙古民族大学,数学与计算机科学学院,内蒙古,通辽,028043
基金项目:内蒙古高等学校科研项目
摘    要:根据目前道路导航方案以自主车辆型和局部最短路径选择为主的现实,利用GPS技术、分级路由选择算法、移动主机路由选择算法、动态权值修正算法和Dijkstra算法设计了一个综合的道路导航方案.GPS技术实现车辆定位,分级路由选择算法可降低道路的数据复杂性,提高计算机的检索速度,动态权值修正算法可实时修改道路的权值,Dijkstra算法可实现最短路径查找.该方案可实现全国范围内任意两个地点的实时最短路径选择,并能进行实时道路导航.

关 键 词:分级路由选择算法  移动主机路由选择算法  动态权值修正算法  Dijkstra算法
文章编号:1000-7024(2006)18-3391-03
收稿时间:2005-08-02
修稿时间:2005-08-02

Comprehensive and effective program used in field of real-time road navigation
ZHANG Chun-sheng.Comprehensive and effective program used in field of real-time road navigation[J].Computer Engineering and Design,2006,27(18):3391-3393.
Authors:ZHANG Chun-sheng
Affiliation:College of Math and Computer Science, Inner Mongolia University for Nationalities, Tongliao 028043, China
Abstract:According to the realization that the path navigation plan is choosed by the independent vehicles and the choice of partially shortest path primarily in present, by using the GPS technology, the grades routing algorithm, the motion host computer routing algorithm, the dynamic weight revising algorithm and the Dijkstra algorithm, a comprehensive path navigation plan is designed. In this plan, the GPS technology realize vehicles positioning. Grades the routing algorithm reduce the complexity of path data and enhances the search speed of computer and the dynamic weight revising algorithm revise path weight real-time. The Dijkstra algorithm realize shortest path search. This plan realize choices shortest path between any two places in the national scope real-time, and carry on the real-time path navigation.
Keywords:GPS
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号