Journal of East China Normal University(Natural Science) ›› 2020, Vol. 2020 ›› Issue (6): 63-71.doi: 10.3969/j.issn.1000-5641.201921022

• Computer Science • Previous Articles     Next Articles

Online map matching algorithm based on the gated recurrent unit model

CHEN Liangjian, XU Jianqiu   

  1. College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing 211106, China
  • Received:2019-06-10 Published:2020-12-01

Abstract: Map matching is a key technology in the field of road network trajectory data analysis. A fast and accurate map matching algorithm can provide good technical support for upper-layer applications. With the explosive growth of trajectory data, existing online map matching algorithms experience a delay phenomenon; in particular, in the context of low-frequency trajectory data, it is impossible to quickly perform map matching on trajectory data. The development of neural networks and deep learning provide new methods for solving these problems. This paper uses the gated recurrent unit(GRU) model to quickly locate candidate segments of trajectory sampling points, thus accelerating the calculation process for online map matching. The proposed method is experimentally compared to the latest online map matching algorithm; the results show that the GRU-based online map matching algorithm can effectively speed-up the matching process and improve matching efficiency.

Key words: online map matching, moving object, gated recurrent unit (GRU) model

CLC Number: