The path inference filter: model-based low-latency map matching of probe vehicle data

We consider the problem of reconstructing vehicle trajectories from sparse sequences of GPS points, for which the sampling interval is between 10 seconds and 2 minutes. We introduce a new class of algorithms, called altogether path inference filter (PIF), that maps GPS data in real time, for a variety of trade-offs and scenarios, and with a high throughput. Numerous prior approaches in map-matching can be shown to be special cases of the path inference filter presented in this article. We present an efficient procedure for automatically training the filter on new data, with or without ground truth observations. The framework is evaluated on a large San Francisco taxi dataset and is shown to improve upon the current state of the art. This filter also provides insights about driving patterns of drivers. The path inference filter has been deployed at an industrial scale inside the Mobile Millennium traffic information system, and is used to map fleets of data in San Francisco, Sacramento, Stockholm and Porto.Comment: Preprint, 23 pages and 23 figure

A Force-Directed Approach for Offline GPS Trajectory Map Matching

We present a novel algorithm to match GPS trajectories onto maps offline (in batch mode) using techniques borrowed from the field of force-directed graph drawing. We consider a simulated physical system where each GPS trajectory is attracted or repelled by the underlying road network via electrical-like forces. We let the system evolve under the action of these physical forces such that individual trajectories are attracted towards candidate roads to obtain a map matching path. Our approach has several advantages compared to traditional, routing-based, algorithms for map matching, including the ability to account for noise and to avoid large detours due to outliers in the data whilst taking into account the underlying topological restrictions (such as one-way roads). Our empirical evaluation using real GPS traces shows that our method produces better map matching results compared to alternative offline map matching algorithms on average, especially for routes in dense, urban areas.Comment: 10 pages, 12 figures, accepted version of article submitted to ACM SIGSPATIAL 2018, Seattle, US

Analysing Human Mobility Patterns of Hiking Activities through Complex Network Theory

The exploitation of high volume of geolocalized data from social sport tracking applications of outdoor activities can be useful for natural resource planning and to understand the human mobility patterns during leisure activities. This geolocalized data represents the selection of hike activities according to subjective and objective factors such as personal goals, personal abilities, trail conditions or weather conditions. In our approach, human mobility patterns are analysed from trajectories which are generated by hikers. We propose the generation of the trail network identifying special points in the overlap of trajectories. Trail crossings and trailheads define our network and shape topological features. We analyse the trail network of Balearic Islands, as a case of study, using complex weighted network theory. The analysis is divided into the four seasons of the year to observe the impact of weather conditions on the network topology. The number of visited places does not decrease despite the large difference in the number of samples of the two seasons with larger and lower activity. It is in summer season where it is produced the most significant variation in the frequency and localization of activities from inland regions to coastal areas. Finally, we compare our model with other related studies where the network possesses a different purpose. One finding of our approach is the detection of regions with relevant importance where landscape interventions can be applied in function of the communities.Comment: 20 pages, 9 figures, accepte

Developing travel time estimation methods using sparse GPS data

Existing methods of estimating travel time from GPS data are not able to simultaneously take account of the issues related to uncertainties associated with GPS and spatial road network data. Moreover, they typically depend upon high frequency data sources from specialist data providers which can be expensive and are not always readily available. The study reported here therefore sought to better estimate travel time using ‘readily available’ vehicle trajectory data from moving sensors such as buses, taxis and logistical vehicles equipped with GPS in ‘near’ real-time. To do this, accurate locations of vehicles on a link were first map-matched to reduce the positioning errors associated with GPS and digital road maps. Two mathematical methods were then developed to estimate link travel times from map-matched GPS fixes, vehicle speeds and network connectivity information with a special focus on sampling frequencies, vehicle penetration rates and time window lengths. GPS data from Interstate I-880 (California, USA) for a total of 73 vehicles over 6 hours were obtained from the UC-2 Berkeley’s Mobile Century Project, and these were used to evaluate several travel time estimation methods, the results of which were then validated against reference travel time data collected from high resolution video cameras. The results indicate that vehicle penetration rates, data sampling frequencies, vehicle coverage on the links and time window lengths all influence the accuracy of link travel time estimation. The performance was found to be best in the 5 minute time window length and for a GPS sampling frequency of 60 seconds