基于卡尔曼滤波的电动自行车轨迹简化与自适应地图匹配算法研究
DOI:
作者:
作者单位:

杭州电子科技大学

作者简介:

通讯作者:

中图分类号:

基金项目:

工信部工业互联网创新发展工程项目, 浙江省自然科学基金


Research on Trajectory Simplification Based on Kalman Filtering and Adaptive Map Matching Algorithm for Electric Bicycle
Author:
Affiliation:

Hangzhou Dianzi University

Fund Project:

Project on Industrial Internet Innovation and Development of Ministry of Industry and Information Technology of China, Zhejiang Provincial Natural Science Foundation of China

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    近年来,随着全球定位系统(Global Positioning System, GPS)的大范围应用,越来越多的电动自行车装配了GPS传感器,由此产生的海量轨迹数据是深入了解用户出行规律、为城市规划者提供科学决策支持等诸多应用的重要基础.但是,电动自行车上普遍使用的价格低廉的GPS传感器无法提供高精度的定位,同时,电动自行车轨迹数据地图匹配过程因以下原因更具有挑战性:1)存在着大量的停留点,2)轨迹采样频率较高使得相邻轨迹点的距离较短,3)电动自行车可行驶的路段更多,存在大量无效轨迹.针对上述问题,本文提出了一种可自适应路网精度的电动自行车轨迹地图匹配方法KFTS-AMM.该方法融合了基于分段卡尔曼滤波算法的轨迹简化算法(KFTS),以及分段隐马尔可夫模型的地图匹配算法(AMM).首先,利用卡尔曼滤波算法可用于最优状态估计的特性,KFTS能够在轨迹简化过程中对轨迹点进行自动修正,使轨迹曲线变得平滑并减少了异常点对于地图匹配准确率的影响.同时,使用基于分段隐马尔可夫模型的地图匹配算法AMM,避免了部分无效轨迹对整条轨迹匹配的影响.此外,在轨迹数据的处理过程加入了停留点的识别与合并,进一步提升了匹配准确率.在郑州市真实电动自行车轨迹数据上进行的实验结果表明,KFTS-AMM在准确率上相对于已有的对比算法有较大的提升,并可通过使用简化后的轨迹数据显著提升匹配速度.

    Abstract:

    In recent years, with the wide application of global positioning system (GPS), more and more electric bicycles are equipped with GPS sensors. A massive amount of trajectory data recorded by those sensors are of great value in many fields, such as users"" travel patterns analysis, decision support for urban planners and so on. However, the low-cost GPS sensors widely used on electric bicycles cannot provide high-precision positioning. Besides some characteristics of the electric bicycles’ track data make the matching process more complex and challenging: 1) there are a large number of stay points on electric bicycles’ trajectories; 2) the original track data generated by the electric bicycle have higher sampling frequency and shorter distance between adjacent track points; 3) some roads only open for electric bicycles, and the accuracy of matching is sensitive to the quality of the road network. To solve those problems mentioned above, we propose an adaptive and accurate road network map matching algorithm named KFTS-AMM, which consists of two main components: 1) the segmented Kalman Filtering based Trajectory Simplification (KFTS) algorithm and 2) segmented Hidden Markov Model based Adaptive Map Matching (AMM) algorithm. Based on the characteristics that Kalman Filtering algorithm can be used for optimal state estimation, the trajectory simplification algorithm KFTS can make the trajectory curve smoother and reduce the impact of abnormal points on the accuracy of map matching by fixing the trajectory points automatically in the process of trajectory simplification. Besides, we use the matching algorithm AMM to reduce the impact of invalid trajectory segments on the map matching accuracy. Moreover, we add stay points identification and merging step into the processing of track data, and the accuracy is further improved. The results of extensive experiments conducted on the real-world track dataset of electric bicycles in Zhengzhou city show that the proposed approach KFTS-AMM outperforms baselines in terms of accuracy and can speed up the matching process by using the simplified track data significantly.

    参考文献
    相似文献
    引证文献
引用本文
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2021-01-07
  • 最后修改日期:2021-10-26
  • 录用日期:2021-11-19
  • 在线发布日期:
  • 出版日期:
文章二维码
您是第位访问者
版权所有:中国科学院软件研究所 京ICP备05046678号-3
地址:北京市海淀区中关村南四街4号,邮政编码:100190
电话:010-62562563 传真:010-62562533 Email:jos@iscas.ac.cn
技术支持:北京勤云科技发展有限公司

京公网安备 11040202500063号