汽车导航系统论文.doc

在汽车导航系统中提供最适路径的研究和实现 摘要 在汽车导航系统中经路探索是很重要的一部分，而经路探索的目的就是提供给用户一条花费最少的最适路径。经典的计算最适路径的方法采用的是Dijkstra算法，但当搜索范围变的很大时，效率会变的非常低。本文是对Dijkstra算法进行改进扩展，并加入了A*算法，提形成了一个更具有实时性的改进算法，从而使探索更具有方向性。此外，对无序经由地情况下的经路计算的几种方案进行了分析和实现，并且经过测试的数据，分析了几种方案的优点和缺点以及他们适用的场合。 为了演示改进的算法，本文设计了一个模拟导航系统的模型。先收集一幅电子地图的道路数据，再对收集到的数据进行解析。通过MFC绘制电子地图，用户可以通过在地图上用鼠标点击选择出发地和目的地，或者通过地点检索选择标志性建筑物设定出发地和目的地，从而可以计算出出发地到目的地之间最优路径，包括推荐道路，道幅优先，距离优先三种不同优先级的最优道路。计算最优路径时使用的是改进算法。 关键词 汽车导航系统；Dijkstra算法；电子地图；路径 Research and Realization of Offering the Best Route in Automobile Navigation System Abstract Route Production is a very important part in the Car Navigation System, and the purpose of Route Production is to provide a minimum-cost path to users. The Dijkstra method is a well-known algorithm for finding the optimum path in the shortest path search problems. The time becomes remarkably long when the search scope is broad. In this paper, it proposes a method which extends the Dijkstra method for real-time problems. In addition, cases of disorder through to the calculation by way of several options were analyzed and realized. After tested a lot of data, the paper has analyzed a number of program strengths and weaknesses as well as their application of occasions. To demonstrate the improved algorithm, the paper has designed a model of Route Production in the Car Navigation System in this paper. First of all, the user must collect the data of the electronic road map and analyzes the data. Then the system has used Microsoft Visual C++ 6.0 MFC to describe the map. Finally the user can click the mouse on the map to choose the starting point and the destination, or select landmark buildings to set the starting point and the destination. The system can calculate an optimal path between the starting point and the destination, including the recommended road, the road of amplitude priority, and the road of distance priority. The system has used the improved algorithm to calculate the optimal path. Keyword The Automobile Navigat