...
首页> 外文期刊>Frontiers of Information Technology & Electronic Engineering >Towards adaptable and tunable cloud-based map-matching strategy for GPS trajectories
【24h】

Towards adaptable and tunable cloud-based map-matching strategy for GPS trajectories

机译:面向GPS轨迹的自适应云可调地图匹配策略

获取原文
           

摘要

Smart cities have given a significant impetus to manage traffic and use transport networks in an intelligent way. For the above reason, intelligent transportation systems (ITSs) and location-based services (LBSs) have become an interesting research area over the last years. Due to the rapid increase of data volume within the transportation domain, cloud environment is of paramount importance for storing, accessing, handling, and processing such huge amounts of data. A large part of data within the transportation domain is produced in the form of Global Positioning System (GPS) data. Such a kind of data is usually infrequent and noisy and achieving the quality of real-time transport applications based on GPS is a difficult task. The map-matching process, which is responsible for the accurate alignment of observed GPS positions onto a road network, plays a pivotal role in many ITS applications. Regarding accuracy, the performance of a map-matching strategy is based on the shortest path between two consecutive observed GPS positions. On the other extreme, processing shortest path queries (SPQs) incurs high computational cost. Current map-matching techniques are approached with a fixed number of parameters, i.e., the number of candidate points (NCP) and error circle radius (ECR), which may lead to uncertainty when identifying road segments and either low-accurate results or a large number of SPQs. Moreover, due to the sampling error, GPS data with a high-sampling period (i.e., less than 10 s) typically contains extraneous datum, which also incurs an extra number of SPQs. Due to the high computation cost incurred by SPQs, current map-matching strategies are not suitable for real-time processing. In this paper, we propose real-time map-matching (called RT-MM), which is a fully adaptive map-matching strategy based on cloud to address the key challenge of SPQs in a map-matching process for real-time GPS trajectories. The evaluation of our approach against state-of-the-art approaches is performed through simulations based on both synthetic and real-world datasets.
机译:智慧城市极大地推动了交通管理和以智能方式使用交通网络。由于上述原因,智能交通系统(ITS)和基于位置的服务(LBS)在过去的几年中已成为一个有趣的研究领域。由于运输领域内数据量的迅速增加,云环境对于存储,访问,处理和处理如此大量的数据至关重要。运输领域中的大部分数据都是以全球定位系统(GPS)数据的形式生成的。这种数据通常很少且嘈杂,并且基于GPS实现实时运输应用程序的质量是一项艰巨的任务。地图匹配过程负责将观察到的GPS位置精确对准道路网络,在许多ITS应用中起着关键作用。关于准确性,地图匹配策略的性能基于两个连续观察到的GPS位置之间的最短路径。另一方面,处理最短路径查询(SPQ)会导致高计算成本。使用固定数量的参数(即候选点数(NCP)和误差圆半径(ECR))来接近当前的地图匹配技术,这可能会在确定路段时导致不确定性以及结果不准确或较大SPQ数。此外,由于采样误差,具有高采样周期(即,小于10s)的GPS数据通常包含无关的数据,这也引起额外数量的SPQ。由于SPQ会产生高昂的计算成本,因此当前的地图匹配策略不适合实时处理。在本文中,我们提出了实时地图匹配(称为RT-MM),这是一种基于云的完全自适应地图匹配策略,旨在解决SPQs在实时GPS轨迹地图匹配过程中的关键挑战。通过基于合成数据集和真实数据集的模拟,可以对我们的方法与最新方法进行评估。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号