基于GeoHash编码的候选路段检索方法

A GeoHash-based candidate roads retrieval method

地图匹配是生活中常用的位置服务和轨迹挖掘的基础,其首要环节是获取轨迹点的候选路段。在候选路段检索时,传统路网网格划分方法存在不相关路段冗余或者忽略正确进行候选路段的问题,导致地图匹配效率较低、匹配质量下降。针对这些问题,提出了一种基于GeoHash编码的候选路段检索方法。采用GeoHash编码将城市道路路网数据进行分块并编码,建立路网的网格索引,结合设置误差圆快速获取候选路段集,并通过地图匹配验证效果。结果表明,当全球导航卫星系统(GNSS)轨迹点的误差圆半径为200 m时,匹配精度最高,匹配正确率高于95%。该方法有效提高了候选路段检索的效率,并在保证匹配质量的同时,提升了地图匹配整体效率。

Map matching is the basis of location service and trajectory mining technology commonly used in life.The first step of map matching is to obtain the candidate road segments of the track points.The traditional road network gridding method suffers redundant irrelevant links or ignores the correct candidate links when searching for candidate links,which causes the reduction of map matching efficiency and quality.To solve these problems,this paper proposes a candidate link retrieval method based on GeoHash coding.The GeoHash coding method is employed to block and code the urban road network data,establish the grid index of the road network,and quickly obtain the candidate road segment set by setting the error circle.Finally,the effect is verified by map matching.The experimental results show that the matching accuracy of Global Navigation Satellite Systems(GNSS)track points is more than 95%,and the matching accuracy reaches the highest when the error circle radius is 200 m.This method effectively improves the retrieval efficiency of candidate road sections and improves the overall efficiency of map matching under the condition of ensuring the matching quality.