文档介绍：摘要
摘要
地图匹配和路径规划算法是GPS车辆定位导航系统研究的核心内容和关键技
术，也是影响智能交通系统(ITS)发展的主要环节；同时能为用户的出行提供智能
化导航服务，从而有效地缓解诸如交通堵塞、环境污染、交通事故等一系列交通
问题。
本文在详细阐述车辆定位导航系统的相关知识的基础上，着重对地图匹配和
路径规划算法进行了研究。针对地图匹配算法，根据实际行驶中角度变化的大小
采取不同的匹配方法。角度变化较小时采用历史轨迹推断匹配法，角度变化较大
时采用曲线拟合法，即将低速但匹配精度较高的曲线拟合法与高速但匹配精度较
低的历史轨迹推断匹配法相结合，并在Visual Basic ，从而
获得了较高的匹配精度和较快的匹配速度。针对路径规划算法，通过对经典最短
路径算法的深入理解，采用了前向关联边存储结构及A*算法，并在Visual Basic
的环境下编程实现了最短路径算法、必经节点及避开节点等限制条件下的最优路
径算法、时间最优路径算法以及必经、避开和距离、时间综合最优路径算法。完
成了车辆定位导航系统中较实用的软件开发。
关键词：GPS 地图匹配 路径规划 车辆定位导航
Abstract
Abstract
Map-Matching and Route Planning Algorithms are core contents which are
studied in GPS Vehicle Location & Navigation System(VLNS). Their results decide
directly the development of VLNS and then influence the improvement of Intelligent
Transportation System(ITS). Then the going convenience of customer is provided, thus
the problems of transportation stop, environment pollution and traffic accident are
effectively alleviated.
On the basis of describing VLNS related knowledge in detail, Map-Matching and
Route Planning Algorithms are researched emphatically. For Map-Matching Algorithm,
a new method that History Track Deduction Matching Method which has fast matching
velocity and low matching precise is adopted when angle is small and Curve Imitated
Method which has slow matching velocity and high matching precise is used when
angle is large. Consequently, higher matching precise and more fast matching velocity
are obtained. For Route Planning Algorithm, on the basis of understanding deeply
classic shortest path algorithms, forward-pointed arcs method and A* algorithm are
adopted which both save memory space and shorten running time and raise searching
efficiency, and then the limited(such as necessary node, avoided node, and so on)
Optimum Plan