首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Likelihood-based offline map matching of GPS recordings using global trace information
Institution:1. Transport and Logistics Group, Delft University of Technology, Jaffalaan 5, 2628 BX Delft, The Netherlands;2. Urban Planning Group, Eindhoven University of Technology, PO Box 513, 5600 MB Eindhoven, The Netherlands;1. School of Business, Jianghan University, Wuhan 430056, China;2. Institute of Intelligent Decision-Making, Jianghan University, Wuhan 430056, China;3. Manufacturing Industry Development Research Centre on Wuhan City Circle, Wuhan 430056, China;4. School of Accounting, Information Systems and Supply Chain, RMIT University, Melbourne, VIC 3000, Australia;1. Department of Civil and Environmental Engineering, Korea Advanced Institute of Science and Technology, 291 Daehak-ro, Yuseong-gu, Daejeon, Republic of Korea;2. The Korea Transport Institute, 370 Sicheong-daero, Sejong-si 30147, Republic of Korea
Abstract:In batch map matching the objective is to derive from a time series of position data the sequence of road segments visited by the traveler for posterior analysis. Taking into account the limited accuracy of both the map and the measurement devices several different movements over network links may have generated the observed measurements. The set of candidate solutions can be reduced by adding assumptions about the traveller’s behavior (e.g. respecting speed limits, using shortest paths, etc.). The set of feasible assumptions however, is constrained by the intended posterior analysis of the link sequences produced by map matching. This paper proposes a method that only uses the spatio-temporal information contained in the input data (GPS recordings) not reduced by any additional assumption.The method partitions the trace of GPS recordings so that all recordings in a part are chronologically consecutive and match the same set of road segments. Each such trace part leads to a collection of partial routes that can be qualified by their likelihood to have generated the trace part. Since the trace parts are chronologically ordered, an acyclic directed graph can be used to find the best chain of partial routes. It is used to enumerate candidate solutions to the map matching problem.Qualification based on behavioral assumptions is added in a separate later stage. Separating the stages helps to make the underlying assumptions explicit and adaptable to the purpose of the map matched results. The proposed technique is a multi-hypothesis technique (MHT) that does not discard any hypothesized path until the second stage.A road network extracted from OpenStreetMap (OSM) is used. In order to validate the method, synthetic realistic GPS traces were generated from randomly generated routes for different combinations of device accuracy and recording period. Comparing the base truth to the map matched link sequences shows that the proposed technique achieves a state of the art accuracy level.
Keywords:GPS traces  Map matching  Transportation modeling  Big data analysis
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号