针对探测车历史数据的离线地图匹配算法  

Offline Map-matching for Archived Probe Vehicle Data

作　　者：李强[1] 曹鹏[1] 缪立新[1] 

机构地区：[1]清华大学深圳研究生院,深圳市丽水路2279号518055

出　　处：《武汉大学学报（信息科学版）》2013年第2期244-247,共4页Geomatics and Information Science of Wuhan University

基　　金：国家自然科学基金资助项目(50808108)

摘　　要：在现有的离线地图匹配算法基础上,采用两次栅格化的思想设计改进算法,大幅度减少了原有地图匹配算法中点到线段距离的计算次数。试验结果显示,本文算法提升地图匹配效率的同时保持了较高的匹配精度,可快速处理大规模的、数据发送间隔在10～60s之间的探测车历史数据。Matching a trajectory of probe vehicle to the roads on the map is necessary to calculate link travel time from probe data. Based on existing offline map-matching algorithms, a map-matching algorithm aiming at archived probe vehicle data is developed. Idea of twice gridding is incorporated into the algorithm, which brings greatly decrease of counts for computing the distance from point to link. Experimental results show that the proposed algorithm significantly improves the efficiency and holds a relative high level accuracy for mapmatching. This algorithm is capable of dealing with large-scale archived probe vehicle data having data-sending-rate of one point every 10-60 s.

关 键 词：探测车 地图匹配 GPS 历史数据 

分 类 号：U491.1[交通运输工程—交通运输规划与管理]