基于GPS轨迹数据的地图匹配算法

针对GPS浮动车轨迹数据具有整体运动趋势的特点,结合城市路网行车限制的约束,提出一种GPS轨迹数据的全局地图匹配方法,综合考虑轨迹曲线与路网路径的曲线相似性、实际行车的路段几何拓扑和交通管制约束下的连通性,实现较好的地图匹配效果,并通过实验进行验证,为GPS浮动车数据的进一步分析应用打下基础。     

浮动车地图匹配算法研究

针对现有浮动车地图匹配算法应用于城市复杂路网时面临的关键技术难点,本文基于浮动车数据,在 SuperMap GIS 平台下实现了城市交通路网的构建,并研究了一种浮动车地图匹配的新算法：基于网格的候选路段确定,基于距离、航向、可达性权重的定位点匹配及基于最短路径的行驶轨迹选择。算法能够满足浮动车地图匹配准确性与实时性的要求,为获取城市道路的交通拥堵状况信息提供可靠依据。     

基于点序列和要素加权法的地图匹配算法

浮动车数据(Floating Car Data,FCD)已广泛应用于城市规划、智能交通系统中,其中地图匹配一直以来都是浮动车数据应用的技术难点。本文在已有地图匹配算法的基础上,提出了基于点序列和要素加权法的地图匹配模型,不仅考虑了当前GPS点的信息,同时也考虑了GPS数据的历史信息和道路网的拓扑结构,从空间关系上分析车辆行驶轨迹和道路的相似性。作者通过上海市出租车轨迹数据对算法进行验证,结果表明:该匹配模型解决了已有地图匹配算法的一些弊端,并且提高了地图匹配的精度,具有高效、实用的特点。     

一种基于约束的最短路径低频浮动车数据地图匹配算法

针对精度差、频率低的浮动车数据特点,给出了空间和拓扑约束下的最短路径浮动车数据地图匹配算法,基于不同采样频率的匹配结果证明算法准确度高。基于武汉市浮动车数据的匹配结果表明,算法具有高可靠性,可以用于浮动车数据的交通信息提取与特征挖掘。     

一种改进的浮动车地图匹配算法

现有地图匹配算法应用于低频方式采样的浮动车GPS数据时匹配准确度与匹配效率不能同时兼顾。基于此,本文提出了一种改进的浮动车地图匹配算法,基于改进的自适应电子地图网格划分方法快速确定待匹配定位点候选路段集,基于最短距离权重、车辆航向权重、最短路径权重及轨迹方向权重的总权重准确确定最优匹配路段及匹配点。试验结果表明,该算法在保证匹配效率的同时提高了算法的匹配准确度。     

浮动车轨迹点地图匹配及插值算法

针对带有定位误差和异常值的浮动车轨迹点数据,该文设计并实现了滑动窗口最优路径地图匹配算法,在综合考虑轨迹点的空间几何关系和路网拓扑关系基础上,为轨迹点匹配最优道路并纠正轨迹点误差。其次,针对稀疏且时间间隔不稳定的匹配后轨迹点,设计改进的Hermite插值法拟合车辆运动状态,并对稀疏轨迹点进行时序插值。利用南京市出租车轨迹点数据进行匹配算法与插值算法的验证,实验结果表明匹配算法具有较高准确性,插值算法能有效还原车辆行驶状态。     

利用地图栅格化的海量浮动车数据道路匹配快速算法

目的 提出了在大城市路网环境下快速确定海量浮动车数据匹配路段的方法。首先构建路网道路缓冲区,再对道路缓冲区地图进行栅格化处理,并构建空间位置与道路ID的索引,然后基于每个浮动车数据中的地理位置信息依据索引找出浮动车数据可能的匹配道路,最后对这些道路进行匹配度计算,确定浮动车数据的匹配道路。实验表明,该方法能显著减少每个浮动车数据需要计算匹配度道路的数量,成倍地提高海量浮动车数据道路匹配算法的效率。     

一种基于空间语义特征的浮动车轨迹匹配技术

针对浮动车轨迹数据挖掘中的空间语义分析问题, 阐述了传统的电子导航地图匹配方法用于浮动车轨迹地图匹配时的主要问题, 提出了基于空间语义特征的浮动车轨迹匹配算法, 并结合实际数据进行了试验验证, 本文提出的基于空间语义特征的全局路径匹配方法取得了很好的匹配效果, 并可还原浮动车轨迹经由的真实路径。     

曲率积分约束的GPS浮动车地图匹配方法

提出了以轨迹曲线的曲率积分值作为地图匹配特征的匹配方法,利用轨迹曲率积分值约束前后相邻轨迹点的关联匹配,采用不同类型行驶路径以及不同采样间隔,实施了浮动车地图匹配试验,结果表明,以匹配正确率和稳定性评判,本文提出的曲率积分约束的浮动车地图匹配方法优于现有的未采用曲率特征匹配的经典浮动车地图匹配方法。     

一种改进的快速浮动车地图匹配方法

浮动车地图匹配算法能够实现浮动车离散点与路段的快速准确匹配,是浮动车路况信息生成技术中的核心环节。本文针对现有方法的不足,实现了建立定位点的有效阈值缓冲区,并依据空间关系检索候选匹配路段,研究实现了一种利用行驶速度、行驶方向、投影距离、行驶距离4个参数进行行车轨迹判别的逻辑匹配算法。试验表明,该方法无需对路网数据进行大量的前期处理工作,简化了候选匹配路段的检索过程,在保证匹配正确率的同时也表现出了更高的效率。     

利用GPS轨迹二次聚类方法进行道路拥堵精细化识别

针对当前在精细识别道路拥堵时空范围方面研究的不足,提出一种利用GPS轨迹的二次聚类方法,通过快速识别大批量在时间、空间上差异较小且速度相近的轨迹段,反映出道路交通状态及时空变化趋势,并根据速度阈值确定拥堵状态及精细时空范围。首先将轨迹按采样间隔划分成若干条子轨迹,针对子轨迹段提出相似队列的概念,并设计了基于密度的空间聚类的相似队列提取方法,通过初次聚类合并相似子轨迹段,再利用改进的欧氏空间相似度度量函数计算相似队列间的时空距离,最后以相似队列为基本单元,基于模糊C均值聚类的方法进行二次聚类,根据聚类的结果进行交通流状态的识别和划分。以广州市主干路真实出租车GPS轨迹数据为例,对该方法进行验证。实验结果表明,该二次聚类方法能够较为精细地反映城市道路的拥堵时空范围,便于管理者精准疏散城市道路拥堵,相比直接聚类方法可以有效提升大批量轨迹数据的计算效率。     

基于GPS时空轨迹的路网拓扑自动变化检测

充分利用出租车GPS时空轨迹数据分布广和时效性强的特点,提出一种基于车载GPS轨迹数据的路网拓扑自动变化检测新方法。该方法首先利用向量相似性度量模型,度量GPS轨迹向量与路网局部拓扑向量之间的相似性,检测疑似道路拓扑变化点,然后通过比较疑似道路拓扑变化点与路网拓扑关系,完成新增、废弃、改建等道路变化,实现基于车载GPS轨迹的路网拓扑自动变化检测。实验结果表明,该方法不仅有效地检测出道路新增、道路废弃与道路改扩建等变化,而且能利用出租车实时和大范围分布特点来实现城市路网大范围实时变化检测。     

符合认知规律的时空轨迹融合与路网生成方法

以行驶在城市大街小巷的出租车GPS时空轨迹数据为研究对象,研究了符合"感知—认知—经验"认知规律3层次的轨迹融合与路网生成方法,提出了基于Delaunay三角网的时空轨迹融合模型,实现了从GPS时空轨迹中对符合认知规律需求的路网信息的获取,并以武汉市出租车GPS轨迹为试验,实现了对武汉市出租车时空轨迹的融合与武汉市路网数据的生成,证明了该方法的有效性。     

路网更新的轨迹-地图匹配方法

全面准确的路网信息作为智慧城市的重要基础之一,在城市规划、交通管理以及大众出行等方面具有重要意义和价值。然而,传统的基于测量的路网数据获取方式往往周期较长,不能及时反映最新的道路信息。近几年,随着定位技术在移动设备的广泛运用,国内外学者在研究路网信息获取时逐渐将视野转向移动对象的轨迹数据中所蕴含的道路信息。当前,基于移动位置信息的路网生成和更新方法多是直接面向全部轨迹数据施加道路提取算法,在处理大规模轨迹或者大范围道路时,计算量极大。为此,本文基于轨迹地图匹配技术,提出一种采用"检查→分析→提取→更新"过程的螺旋式路网数据更新策略。其主要思想是逐条输入轨迹,借助HMM地图匹配发现已有路网中的问题路段,进而从问题路段周边局部范围内的轨迹数据中提取并更新相关道路信息。该方法仅在局部范围内利用少量轨迹数据来修复路网,避免了对整个轨迹数据集进行计算,从而有效减少了计算量。基于OpenStreetMap的武汉市区路网数据以及武汉市出租车轨迹数据的试验表明,本文提出的路网更新方法不仅可行,而且灵活高效。     

Traj2Traj: A road network constrained spatiotemporal interpolation model for traffic trajectory restoration

In transportation, the trajectory data generated by various mobile vehicles equipped with GPS modules are essential for traffic information mining. However, collecting trajectory data is susceptible to various factors, resulting in the lack and even error of the data. Missing trajectory data could not correctly reflect the actual situation and also affect the subsequent research work related to the trajectory. Although increasing efforts are paid to restore missing trajectory data, it still faces many challenges: (1) the difficulty of data restoration because traffic trajectories are unstructured spatiotemporal data and show complex patterns; and (2) the difficulty of improving trajectory restoration efficiency because traditional trajectory interpolation is computationally arduous. To address these issues, a novel road network constrained spatiotemporal interpolation model, namely Traj2Traj, is proposed in this work to restore the missing traffic trajectory data. The model is constructed with a seq2seq network and integrates a potential factor module to extend environmental factors. Significantly, the model uses a spatiotemporal attention mechanism with the road network constraint to mine the latent information in time and space dimensions from massive trajectory data. The Traj2Traj model completes the road-level restoration according to the entire trajectory information. We present the first attempt to omit the map-matching task when the trajectory is restored to solve the time-consuming problem of map matching. Extensive experiments conducted on the provincial vehicle GPS data sets from April 2018 to June 2018 provided by the Fujian Provincial Department of Transportation show that the Traj2Traj model outperforms the state-of-the-art models.     

A Chain-Code-Based Map Matching Algorithm for Wheelchair Navigation

Accurate vehicle tracking is essential for navigation systems to function correctly. Unfortunately, GPS data is still plagued with errors that frequently produce inaccurate trajectories. Research in map matching algorithms focuses on how to efficiently match GPS tracking data to the underlying road network. This article presents an innovative map matching algorithm that considers the trajectory of the data rather than merely the current position as in the typical map matching case. Instead of computing the precise angle which is traditionally used, a discrete eight-direction chain code, to represent a trend of movement, is used. Coupled with distance information, map matching decisions are made by comparing the differences between trajectories representing the road segments and GPS tracking data chain-codes. Moreover, to contrast the performance of the chain-code algorithm, two evaluation strategies, linear and non-linear, are analyzed. The presented chain-code map matching algorithm was evaluated for wheelchair navigation using university campus sidewalk data. The evaluation results indicate that the algorithm is efficient in terms of accuracy and computational time.     

Mobile user identification based on road networks and multiple distance measures

Mobile user identification aims at matching different mobile devices of the same user using trajectory data, which has attracted extensive research in recent years. Most of the previous work extracted trajectory features based on regular grids, which will lead to incorrect feature representation due to lack of geographic information. Besides, most trajectory similarity models only considered one single distance measure to calculate the similarity between users, which ignore the connection between different distance measures and may lead to some false matches. In light of this, we present a novel user identification method based on road networks and multiple distance measures in this article. The proposed method segments a city map into several grids and road segments based on road networks. Then it extracts location and road information of trajectories to jointly construct user features. Multiple distance measures are fused by a discriminant model to improve the effect of user identification. Experiments on real GPS trajectory datasets show that our proposed method outperforms related similarity measure methods and is stable for mobile user identification. Meanwhile, our method can also achieve good identification results even on sparse trajectory datasets.     

Estimating traffic speed and speeding using passively collected big mobility data and a distributed computing framework

With the increasing availability of location-aware devices, passively collected big GPS trajectory data offer new opportunities for analyzing human mobility. Processing big GPS trajectory data, especially extracting information from billions of trajectory points and assigning information to corresponding road segments in road networks, is a challenging but necessary task for researchers to take full advantage of big data. In this research, we propose an Apache Spark and Sedona-based computing framework that is capable of estimating traffic speeds for statewide road networks from GPS trajectory data. Taking advantage of spatial resilient distributed datasets supported by Sedona, the framework provides high computing efficiency while using affordable computing resources for map matching and waypoint gap filling. Using a mobility dataset of 126 million trajectory points collected in California, and a road network inclusive of all road types, we computed hourly speed estimates for approximately 600,000 segments across the state. Comparing speed estimates for freeway segments with speed limits, our speed estimates showed that speeding on freeways occurred mostly during the nighttime, while analysis of travel on residential roads showed that speeds were relatively stable over the 24-h period.