{"title":"交通应用地图匹配候选链接的一种新技术","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":"{\"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}","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}
A new technique to find candidate links for map matching for transportation applications
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.