摘要
地图匹配技术是浮动车系统从数据接收到结果展示各个环节中最为关键的一项内容,但是目前国际上浮动车系统多用于路网结构简单的高速公路系统,而将匹配技术应用于立交遍布、主辅路交错的复杂城市道路系统时往往得不到满意的匹配效果。文章通过对现有各种地图匹配方法的分析比较,针对大采集时间间隔GPS数据在北京市复杂路网结构中遇到的实际问题,提出了一种局部节点匹配的改进的最优路径选择算法,将该算法应用于实验系统后,获得了令人满意的匹配速度与准确度,证实了这一地图匹配算法能较好地适用于现代复杂城市路网的实时浮动车计算系统。
Map-matching algorithm is the most important technology in Floating Car System （FCD） from data reception to result display. However, presently the FCD has been mainly applied in highway systems, which have simple structure of road network. When the algorithm is applied to complex city road network, where main and service roads and complex intersections are distributed here and there, the satisfied matching result cannot be gained. By comparing the existing map-matching algorithms and according to the real problems encountered in Beijing, an advanced algorithm based on route searching with partial node matching was put forward. The test system produces good matching speed and accuracy after being applied to experimental system, which approves that the algorithm fits well for tile real-time FCD of modern complex city road network.
出处
《交通与计算机》
2007年第6期81-84,共4页
Computer and Communications
基金
国家科技攻关项目资助(批准号:2005BA414B05)
北京市科技计划项目资助(批准号:Y0605008040291)
北京市科技新星计划项目资助(批准号:2006B21)
关键词
浮动车
地图匹配
模式识别
网络拓扑
路径搜索
floating car
map matching
mode identification
network topology
route searching
