检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:陈永刚[1] 韩思成 王海涌[2] 高锋阳[1] 魏鹏山 宋鹏飞 CHEN Yonggang;HAN Sicheng;WANG Haiyong;GAO Fengyang;WEI Pengshan;SONG Pengfei(School of Automatization and Electric Engineering,Lanzhou Jiaotong University,Lanzhou 730070,China;School of Electronic and Information Engineering,Lanzhou JiaotongUniversity,Lanzhou 730070,China)
机构地区:[1]兰州交通大学自动化与电气工程学院,兰州730070 [2]兰州交通大学电子与信息工程学院,兰州730070
出 处:《测绘科学》2022年第12期192-199,共8页Science of Surveying and Mapping
基 金:国家自然科学基金项目(20191258);中车“十四五”科技重大专项计划项目(2021CXZ021);国家重点研发计划(“十三五”计划)项目(2017YFB1201003)
摘 要:针对目前虚拟应答器地图匹配采用直接投影法在复杂铁路路段上准确性差、匹配精度低的问题,该文提出了一种复合地图匹配算法。首先将铁路线路进行分段处理,然后根据所划分线路特征的不同,采用不同的地图匹配算法选取列车实际运行的匹配路段,最后进行仿真验证。通过与传统地图匹配算法进行对比,结果表明:在复杂路段下,复合地图匹配算法相对于传统地图匹配算法在匹配准确率上具有显著优势,具有较好的匹配效果,能够有效实现复杂路网下定位点的精准匹配,满足虚拟应答器的定位需要。In view of the problem of poor correctness and low matching precision of the current virtual balise map matching by direct projection method on complex railway sections,a composite map matching algorithm was proposed in this paper.Firstly,the railway lines were segmented,then the matching section where the trains actually travel was selected by different map matching algorithms according to the different characteristics of the segmented line,and finally the simulation was verified.By comparing with the classical map matching algorithm,the result showed that the composite map matching algorithm had a remarkable advantage over the classical map matching algorithm in terms of matching accuracy under the complex railway sections,which could effectively achieve accurate matching of localization points in complex railway networks to meet the localization needs of virtual balise.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.151