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

针对车辆导航定位系统地图匹配算法中传统的平面式网络划分结构，提出了一种基于两级交错式网络划分策略的待配路段快速筛选方法、详细分析了该算法的实现原理．并讨论了与之相关的网络路段信息的提取与存储技术．实验结果表明，采用该方法可有效减少空间数据检索表数据量，提高实时匹配时路网的搜索效率；解决了因网格疏密程度引发的数据存储量、索引时间与网格所包含的有效信息量之间的矛盾；使匹配计算的路段搜索过程与传统方法相比变得简单、方便、明了．

Quick Road Choice Method in Map Matching Algorithms

According to the traditional plane network partition structure of the Map Matching Algorithm for Vehicle Positioning System, a novel quick choice meth od for roads to be matched was presented based on the network structure partitio n of a two-grade overlapping road. The principle of the algorithm was analyzed i n detail. The technology of road information picking and storing relevant to the algorithm was investigated.Experimental results show that the data of spatial d ata index table are reduced effectively and the search efficiency is guaranteed in Map Matching process by this algorithm.The problem due to grid size among dat a 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.