A new technique to find candidate links for map matching for transportation applications

Prashant Kumar, R. Ganti, G. Raina
{"title":"A new technique to find candidate links for map matching for transportation applications","authors":"Prashant Kumar, R. Ganti, G. Raina","doi":"10.1109/COMSNETS.2016.7439965","DOIUrl":null,"url":null,"abstract":"Algorithms for map matching are important for numerous transport applications. Typically, the first step in the development of such algorithms one needs techniques for finding candidate road segments. Most proposals for finding candidate road segments are either computationally very intensive, or not very precise, which puts additional burden on the rest of the algorithm. In this paper, we propose a new quantity called an Alignment Quotient (AQ) to find road segments in close proximity to a GPS data point. We also propose an algorithm that employs the AQ to find candidate road segments, and we conduct a preliminary analysis for the same.","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COMSNETS.2016.7439965","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Algorithms for map matching are important for numerous transport applications. Typically, the first step in the development of such algorithms one needs techniques for finding candidate road segments. Most proposals for finding candidate road segments are either computationally very intensive, or not very precise, which puts additional burden on the rest of the algorithm. In this paper, we propose a new quantity called an Alignment Quotient (AQ) to find road segments in close proximity to a GPS data point. We also propose an algorithm that employs the AQ to find candidate road segments, and we conduct a preliminary analysis for the same.
交通应用地图匹配候选链接的一种新技术
地图匹配算法对许多运输应用都很重要。通常,开发这种算法的第一步需要找到候选路段的技术。大多数寻找候选路段的建议要么计算非常密集,要么不是很精确,这给算法的其余部分带来了额外的负担。在本文中,我们提出了一种新的称为对齐商(AQ)的量来寻找接近GPS数据点的路段。我们还提出了一种利用AQ来寻找候选路段的算法,并对其进行了初步分析。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信