首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于GPS列车定位系统的快速地图匹配算法研究
引用本文:殷燕如,刘金乐.基于GPS列车定位系统的快速地图匹配算法研究[J].铁道通信信号,2011,47(11):60-62,76.
作者姓名:殷燕如  刘金乐
作者单位:1. 兰州交通大学自动化与电气工程学院硕士研究生,兰州,730070
2. 西安铁路局安康电务段助理工程师,陕西安康,725000
摘    要:针对传统地图匹配算法计算量大,搜索速度慢的缺点,引入道路网络分块思想,综合运用最小方向差异及铁路的连通性确定最佳匹配路段,用直接投影法计算列车当前位置,并对识别的路段设置距离和方向条件阈值,进行地图匹配的完备性检测,建立误匹配的检测和修正体系,从而提高匹配的精度。通过与传统地图匹配算法的比较,该地图匹配算法具有搜索速度快、计算量小、耗时少的特点,且与铁路网络的复杂程度无关。

关 键 词:列车定位  地图匹配  网络分块  路段匹配

Algorithmic Study of Fast Map Matching Based on GPS Train location System
Yin Yanru,Liu Jinle.Algorithmic Study of Fast Map Matching Based on GPS Train location System[J].Railway Signalling & Communication,2011,47(11):60-62,76.
Authors:Yin Yanru  Liu Jinle
Institution:Yin Yanru,Liu Jinle
Abstract:Aim at the shortcomings of large computation load and slow searching speed of traditional map matching algorithms,a new method of partitioning road network into grids is introduced.Among which the best matching routes are determined by both the least differences in direction and the connectivity of railways,and the train's current positions are calculated by direct projection method.In order to improve the precision of matching,an mismatch detection and correction system was established to check the completeness of map matching by setting the distance and direction condition thresholds of the best segment.Compared with those traditional map matching algorithms,this map matching algorithm based on grid partition has such advantages as fast search,low computation load,and less time consumption,and independency of the complex degree of railway network.
Keywords:Train locating  Map matching  Grid partition  Segment matching
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号