基于曲线拟合和网络拓扑的综合地图匹配算法  

A Comprehensive Map Matching Algorithm Based on Curve Fitting and Network Topology

作　　者：毕军[1,2] 朱颖[1] 程勇 

机构地区：[1]北京交通大学城市交通复杂系统理论与技术教育部重点实验室,北京100044 [2]北京交通大学北京城市交通协同创新中心,北京100044 [3]山东济宁市鸿翔公路勘察设计研究院,山东济宁272000

出　　处：《交通信息与安全》2014年第6期127-131,共5页Journal of Transport Information and Safety

基　　金：中央高校基本科研业务费专项资金项目(批准号:2013JBM052);北京市科技计划课题项目(批准号:Z131100005613038)资助

摘　　要：为了使车辆导航系统能给人们提供精确可靠的车辆位置信息,提出了1种减少车辆定位误差的综合地图匹配算法。该算法将基于曲线拟合和网络拓扑关系的2种地图匹配算法结合起来,采用误差圆法、最小二乘法及投影法,解决基于曲线拟合算法在靠近的平行路段匹配率不佳的问题。用北京市物流电动车的GPS数据进行多个样本的实验验证,匹配率均在95%以上,单点平均匹配时间在5ms以内,与基于曲线拟合的地图匹配算法相比,综合算法复杂度降低,准确度和实时性提高。结果表明,综合算法可以应用到实际地图匹配工作中,尤其对于相互靠近的平行路段有明显的优势。In order to provide accurate and reliable information of vehicle location in vehicle navigation system, a comprehensive map matching algorithm to reduce error is presented. The algorithm combines the curve fitting with the network topology information to reduce the error of vehicle location. Several analysis methods, including Error Circle, Least Square and Projection, are adopted to solve the low match rate on the parallel roads based on curve fitting method. The GPS data from Beijing logistics electric vehicles are used to verify the algorithm. The results show that the match rate is above 95% and the match time is within 5ms. Compared with the curve fitting algorithm, the comprehensive algorithm decreases the calculation complexity, improves the accuracy and real-time performance, and can be applied to the actual map matching work. The algorithm especially has obvious advantages for parallel sections close to each other.

关 键 词：智能交通 综合地图匹配算法 最小二乘法 车辆导航系统 曲线拟合 网络拓扑 

分 类 号：P228.4[天文地球—大地测量学与测量工程]