A Green Self-Adaptive Approach for Online Map Matching

被引:6
作者
An, Qi [1 ,2 ]
Feng, Zhiyong [1 ,3 ]
Chen, Shizhan [1 ,2 ]
Huang, Keman [4 ]
机构
[1] Tianjin Key Lab Cognit Comp & Applicat, Tianjin 300350, Peoples R China
[2] Tianjin Univ, Sch Comp Sci & Technol, Tianjin 300350, Peoples R China
[3] Tianjin Univ, Sch Comp Software, Tianjin 300350, Peoples R China
[4] MIT, Sloan Sch Management, 77 Massachusetts Ave, Cambridge, MA 02139 USA
来源
IEEE ACCESS | 2018年 / 6卷
基金
中国国家自然科学基金; 国家重点研发计划;
关键词
Online map matching algorithm; hidden Markov model; adaptive sampling; adaptive sliding window; ALGORITHM; MARKOV; PATH;
D O I
10.1109/ACCESS.2018.2869852
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
GPS trajectory data plays a critical role for the intelligent transportation. Due to many factors like measure error, sampling error and battery power-saving requirement, the directly obtained trajectories will inaccurately align to the digital map. This requires an online map matching algorithm with high precision, low latency, and energy consumption saving. However, the existing approaches need to make some trade off among these criterions. Hence, based on the hidden Markov model, this paper proposes an adaptive online map matching algorithm to improve the performances in these perspectives at the same time: 1) the probabilistic method integrating the geometric information and topological information is developed to improve the accuracy; 2) the adaptive sampling frequency method is proposed to reduce the energy consumption; and 3) the adaptive sliding window method is presented to reduce the output delay. The experiments demonstrate that our approaches can not only improve the matching precision, but also reduce the latency and energy consumption simultaneously.
引用
收藏
页码:51456 / 51469
页数:14
相关论文
共 35 条
  • [1] Feature Selection for Hidden Markov Models and Hidden Semi-Markov Models
    Adams, Stephen
    Beling, Peter A.
    Cogill, Randy
    [J]. IEEE ACCESS, 2016, 4 : 1642 - 1657
  • [2] [Anonymous], 2011, Proceedings of the 7th Workshop on Algorithm Engineering and Experiments
  • [3] [Anonymous], 2009, P 17 ACM SIGSPATIAL, DOI [10.1145/1653771.1653820, DOI 10.1145/1653771.1653820]
  • [4] [Anonymous], 2011, P 19 ACM SIGSPATIAL
  • [5] [Anonymous], 2014, INT J CONTROL AUTOMA, DOI DOI 10.14257/IJCA.2014.7.7.14
  • [6] [Anonymous], 2011, HPL2011109
  • [7] Balkic Zoran, 2012, Agent and Multi-Agent Systems. Technologies and Applications. Proceedings 6th KES International Conference, KES-AMSTA 2012, P290, DOI 10.1007/978-3-642-30947-2_33
  • [8] Improved Space Efficient Algorithms for BFS, DFS and Applications
    Banerjee, Niranka
    Chakraborty, Sankardeep
    Raman, Venkatesh
    [J]. COMPUTING AND COMBINATORICS, COCOON 2016, 2016, 9797 : 119 - 130
  • [9] Gheibi, 2015, P INT C TOP THEOR CO, P105
  • [10] Goh CY, 2012, IEEE INT C INTELL TR, P776, DOI 10.1109/ITSC.2012.6338627