基于哈希和路网边权的地图匹配算法及其应用  

Map Matching Algorithm Based on Hash and Edge Weight of Road Network and Its Application

作　　者：邵天浩 张宏军 程恺 唐新德 莫斐 张可 SHAO Tian-hao;ZHANG Hong-jun;CHENG Kai;TANG Xin-de;MO Fei;ZHANG Ke(School of Command and Control Engineering,Army Engineering University of PLA,Nanjing 210000,China)

机构地区：[1]陆军工程大学指挥控制工程学院,江苏南京210000

出　　处：《计算机技术与发展》2020年第8期140-146,共7页Computer Technology and Development

基　　金：国家自然科学基金(61806221)。

摘　　要：现如今车载导航的使用越来越普及,海量的车辆行驶数据使得车辆驾驶行为分析成为一项新的研究热点,但是由于车载导航采集的行驶数据存在一定的偏差,需要对其进行有效的预处理以便准确分析驾驶行为。提出一种以确定性地图匹配算法为依据的新型地图匹配算法,该算法以邻接表的形式存储路网信息,利用geohash函数筛选数据点附近的道路,在匹配过程中通过添加滑动窗口来提高正确率,最后在修正路网边权的基础上搜索最佳路线,将其作为填充空白数据点的依据。该算法便于实现,相比于传统的确定性地图匹配算法具有更高的匹配精度,相对于不确定性地图匹配算法具有更高的匹配速度,并且适用于大段数据异常的情况,可以提高车辆行驶数据的质量,同时满足了车辆实时定位的处理需求。Nowadays,vehicle navigation is becoming more and more popular.Massive vehicle driving data makes vehicle driving behavior analysis a new research hotspot.However,due to some deviations in the collected driving data,effective preprocessing of the driving data is required to accurately analyze the driving behaviors.Based on the deterministic map matching algorithm,we propose a new map matching algorithm.Firstly,this algorithm uses adjacency table to store the road network information.Secondly,by adding a sliding window to improve the accuracy in the matching process,geohash function is used to filter the ways near the data points.Finally,the best route is searched on the basis of correcting the edge weight of road network,and this best route is the basis of filling blank data points.Easily to implement,this algorithm has higher matching accuracy compared with the traditional deterministic map matching algorithm,and it has higher matching speed than the uncertainty of map matching algorithm.Besides,it can not only improve the quality of traffic data,but also meet the processing requirements of vehicle real-time positioning with the fitness of dealing with large data exception.

关 键 词：地图匹配算法 邻接表 geohash函数 路网边权修正 缺失值填充 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]