A Map-matching Algorithm with Extraction of Multi-group Information for Low-frequency Data

The growing use of probe vehicles generates a huge number of GNSS data. Limited by the satellite positioning technology, further improving the accuracy of map-matching is challenging work, especially for low-frequency trajectories. When matching a trajectory, the ego vehicle's spatial-temporal information of the present trip is the most useful with the least amount of data. In addition, there are a large amount of other data, e.g., other vehicles' state and past prediction results, but it is hard to extract useful information for matching maps and inferring paths. Most map-matching studies only used the ego vehicle's data and ignored other vehicles' data. Based on it, this paper designs a new map-matching method to make full use of "Big data". We first sort all data into four groups according to their spatial and temporal distance from the present matching probe which allows us to sort for their usefulness. Then we design three different methods to extract valuable information (scores) from them: a score for speed and bearing, a score for historical usage, and a score for traffic state using the spectral graph Markov neutral network. Finally, we use a modified top-K shortest-path method to search the candidate paths within an ellipse region and then use the fused score to infer the path (projected location). We test the proposed method against baseline algorithms using a real-world dataset in China. The results show that all scoring methods can enhance map-matching accuracy. Furthermore, our method outperforms the others, especially when GNSS probing frequency is less than 0.01 Hz.Comment: 10 pages, 11 figures, 4 table

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

Congestion Articulation Control Using Machine Learning Technique

Congestion is the most serious issue in both Adhoc mobile networking and regular road traffic systems. The definition of a vehicle is changing as the automotive industry advances. Nowadays, all automobiles are outfitted with the most up-to-date sensors and communication capabilities. Mobile Ad Hoc Network that avoids traffic jams and articulation issues while also saving time by receiving direction from the GPS system on the shortest path using various algorithms. It also provides information on road safety and where to go. It repeatedly recalculates the shortest way using multiple algorithms to ensure that the user does not become stuck and stranded in traffic. From the point of view of research, this paper defines the architecture and protocols. However, VANETs are a subset of MANETs and constitute the future of Intelligent Transportation Systems. The development of big data, the latest sensors and probing vehicle data, as well as the widespread use of machine learning technologies, has given articulation control measurement in the traffic congestion area a completely new and different direction. By examining multiple traffic metrics. With machine learning, it is straightforward to forecast traffic congestion. This study is based on traffic congestion forecasting in real-time. This paper presents a summary of recent research conducted using various AI approaches and machine learning models

Road Condition Estimation Based on Heterogeneous Extended Floating Car Data

Road condition estimation based on Extended Floating Car Data (XFCD) from smart devices allows for determining given quality indicators like the international roughness index (IRI). Such approaches currently face the challenge to utilize measurements from heterogeneous sources. This paper investigates how a statistical learning based self-calibration overcomes individual sensor characteristics. We investigate how well the approach handles variations in the sensing frequency. Since the self-calibration approach requires the training of individual models for each participant, it is examined how a reduction of the amount of data sent to the backend system for training purposes affects the model performance. We show that reducing the amount of data by approximately 50 % does not reduce the models’ performance. Likewise, we observe that the approach can handle sensing frequencies up to 25 Hz without a performance reduction compared to the baseline scenario with 50 Hz

Detection and Localization of Traffic Signals with GPS Floating Car Data and Random Forest

As Floating Car Data are becoming increasingly available, in recent years many research works focused on leveraging them to infer road map geometry, topology and attributes. In this paper, we present an algorithm, relying on supervised learning to detect and localize traffic signals based on the spatial distribution of vehicle stop points. Our main contribution is to provide a single framework to address both problems. The proposed method has been experimented with a one-month dataset of real-world GPS traces, collected on the road network of Mitaka (Japan). The results show that this method provides accurate results in terms of localization and performs advantageously compared to the OpenStreetMap database in exhaustivity. Among many potential applications, the output predictions may be used as a prior map and/or combined with other sources of data to guide autonomous vehicles

Crowdsourcing Real-Time Traveler Information Systems

In the last decade, the concept of collecting traffic data using location aware and data enabled smartphones in place of traditional sensor networks has received much attention. With a steady market growth for smartphones enabled with GPS chipsets, the potential of this technology is enormous. This combined with the pervasion of participatory paradigms such as crowdsourcing wherein individuals with portable sensors instead of physical networks serve as sensors providing information. Crowd sensed data overcome a number of issues with traditional physical sensor networks by providing wider coverage, real-time data, data redundancy and cost effectiveness to name a few. While there has been a lot of work on actual implementations of crowd sensed traffic monitoring programs, there is limited work on assessing the quality, and validity of crowd sensed data. A systematic analysis of quality and validity is needed before this paradigm can be more commonly adopted for traffic monitoring applications. To this end, research is underway to deploy a crowdsourced platform for monitoring and providing real-time transit information for shuttles that serve the University of Connecticut. The thesis develops a framework and an open-source prototype system that is able to produce real-time traveler information based on crowdsourced data. In order to build the prototype, first it implements a robust Hidden Markov Model based map-matching algorithm to position the crowdsourced data on the underlying road network and retrieve the likely path. The accuracy of the map-matching algorithm has been found satisfactory for the current usage even when the GPS points are sampled at low frequency. Next, to predict the travel condition across the network from the crowdsourced data, a travel time prediction algorithm, based on Regularized Least Square Regression, has been implemented as well. This travel time prediction algorithm, together with the map-matching algorithm, has been applied in a simulated crowdsourcing environment. The travel time prediction results of the simulation show that the prototype system is quite capable of predicting travel time even when the crowdsourced real-time data is sparse. The simulation tests the performance of the travel time prediction algorithm in different scenarios. From the demonstrated predictive performance of the implemented prototype system, this approach to providing real-time traveler information is found promising. It is also possible to apply the prototype to all regions and all modes of transportation, exploiting its generalized approach of providing real-time traveler information from crowdsourced data