A three-stage online map-matching algorithm by fully using vehicle heading direction
A three-stage online map-matching algorithm by fully using vehicle heading direction
复制标题
充分利用车辆航向的三阶段在线地图匹配算法
DOI：
10.1007/s12652-018-0760-0
复制
发表时间：
2018-10-01
影响因子：
--
通讯作者：
Zhang, Shu
中科院分区：
文献类型：
--
作者：
Chen, Chao;Ding, Yan;Zhang, Shu
地图匹配对于几乎所有智能交通系统都至关重要，包括上下文和个性化服务。为了支持实时智能交通服务，在线地图匹配通常是先决条件。尽管已经提出了许多地图匹配方法，但它们常常无法平衡两个相互冲突的目标，即匹配质量和计算时间。为了缓解这一矛盾，在本文中，我们提出了一种三阶段在线地图匹配算法，称为 SD-Matching，以可证明的智能方式充分利用收集的 GPS 轨迹数据（即车辆前进方向）的新维度。在第一阶段，首先使用航向方向来增强给定 GPS 点的候选边缘的概率计算。在第二阶段，航向也被用来缩小搜索空间，并在两个连续 GPS 点的最短路径计算中充当经济有效的引导者。在第三阶段，进一步利用行驶方向以及道路网络的拓扑来细化一系列 GPS 点的车辆行驶路径。最后，我们使用中国北京市的真实出租车数据和道路网络数据评估 SD-Matching 算法，以证明其有效性和效率。
Map-matching is essential for almost all intelligent transportation systems, including context and personalized services. To support real-time intelligent transportation services, online map-matching is usually a prerequisite. Although many map-matching methods have been proposed, they often fail to balance the two conflicting objectives, i.e., matching quality and computation time. To alleviate the contradiction, in this paper, we propose a three-stage online map-matching algorithm, named as SD-Matching, to fully exploit a new dimension of collected GPS trajectory data (i.e., vehicle heading direction) in a provably smart way. In the first stage, heading direction is first used to enhance the probability computation of candidate edges for a given GPS point. In the second stage, heading direction is also employed to narrow down the searching space and serve as a cost-effective guider in the shortest path computation for two consecutive GPS points. In the third stage, heading direction is further utilized to refine the vehicle travelling path for a sequence of GPS points, together with the topology of the road network. Finally, we evaluate the SD-Matching algorithm using the real-world taxi data and road network data in the city of Beijing, China, to demonstrate its effectiveness and efficiency.