华南理工大学学报(自然科学版) ›› 2004, Vol. 32 ›› Issue (2): 62-66.

• • 上一篇    下一篇

地图匹配算法中的待配路段快速筛选方法

杨新勇1 黄圣国2   

  1. 1.南京航空航天大学 自动化学院‚江苏 南京210016;2.南京航空航天大学 民航学院‚江苏 南京210016
  • 收稿日期:2003-05-26 出版日期:2004-02-20 发布日期:2015-09-07
  • 通信作者: 杨新勇(1973-)男‚博士‚主要从事导航与定位的研究. E-mail:yxydoctor@sohu.com
  • 作者简介:杨新勇(1973-)男‚博士‚主要从事导航与定位的研究.

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

中图分类号: