Journal of South China University of Technology(Natural Science Edition) ›› 2004, Vol. 32 ›› Issue (2): 62-66.

Previous Articles     Next Articles

Quick Road Choice Method in Map Matching Algorithms

Yang Xin-yong1 Huang Sheng-guo2   

  1. 1.College of Automation Engineering‚Nanjing University of Aeronautics&Astronautics‚Nanjing210016‚Jiangsu‚China;
    2.College of Civil Aviation‚Nanjing University of Aeronautics&Astronautics‚Nanjing210016‚Jiangsu‚China
  • Received:2003-05-26 Online:2004-02-20 Published:2015-09-07
  • Contact: 杨新勇(1973-)男‚博士‚主要从事导航与定位的研究. E-mail:yxydoctor@sohu.com
  • About author:杨新勇(1973-)男‚博士‚主要从事导航与定位的研究.

Abstract:  According to the traditional plane network partition structure of the Map Matching Algorithm for Vehicle Positioning System‚a novel quick choice method for roads to be matched was presented based on the network structure partition of a two-grade overlapping road.The principle of the algorithm was analyzed in detail.The technology of road information picking and storing relevant to the algorithm was investigated.Experimental results show that the data of spatial data index table are reduced effec-
tively and the search efficiency is guaranteed in Map Matching process by this algorithm.The problem due to grid size among data number in index table‚time consuming and data validity was solved.As a result‚the simple‚convenient and clear road choice process is superior than traditional method in Map Matching calculation.

Key words: map matching, vector, database, spatial data structure

CLC Number: