Traffic State Estimation via a Particle Filter with Compressive Sensing and Historical Traffic Data

In this paper we look at the problem of estimating traffic states within segments of road using a particle filter and traffic measurements at the segment boundaries. When there are missing measurements the estimation accuracy can decrease. We propose two methods of solving this problem by estimating the missing measurements by assuming the current measurements will approach the mean of the historical measurements from a suitable time period. The proposed solutions come in the form of an l1 norm minimisation and a relevance vector machine type optimisation. Test scenarios involving simulated and real data verify that an accurate estimate of the traffic measurements can be achieved. These estimated missing measurements can then be used to help to improve traffic state estimation accuracy of the particle filter without a significant increase in computation time. For the real data used this can be up to a 23.44% improvement in RMSE values

Citywide Estimation of Traffic Dynamics via Sparse GPS Traces

Traffic congestion is a perpetual challenge in metropolitan areas around the world. The ability to understand traffic dynamics is thus critical to effective traffic control and management. However, estimation of traffic conditions over a large-scale road network has proven to be a challenging task for two reasons: first, traffic conditions are intrinsically stochastic; second, the availability and quality of traffic data vary to a great extent. Traditional traffic monitoring systems that exist mostly on major roads and highways are insufficient to recover the traffic conditions for an entire network. Recent advances in GPS technology and the resulting rich data sets offer new opportunities to improve upon such traditional means, by providing much broader coverage of road networks. Despite that, such data are limited by their spatial-temporal sparsity in practice. To address these issues, we have developed a novel framework to estimate travel times, traversed paths, and missing values over a large-scale road network using sparse GPS traces. Our method consists of two phases. In the first phase, we adopt the shortest travel time criterion based on Wardrop\u27s Principles in the map-matching process. With an improved traveltime allocation technique, we have achieved up to 52.5% relative error reduction in network travel times compared to a state-of-the-art method [1]. In the second phase, we estimate missing values using Compressed Sensing algorithm, thereby reducing the number of required measurements by 94.64%

Multi-dimensional urban sensing in sparse mobile crowdsensing

International audienceSparse mobile crowdsensing (MCS) is a promising paradigm for the large-scale urban sensing, which allows us to collect data from only a few areas (cell selection) and infer the data of other areas (data inference). It can significantly reduce the sensing cost while ensuring high data quality. Recently, large urban sensing systems often require multiple types of sensing data (e.g., publish two tasks on temperature and humidity respectively) to form a multi-dimensional urban sensing map. These multiple types of sensing data hold some inherent correlations, which can be leveraged to further reduce the sensing cost and improve the accuracy of the inferred results. In this paper, we study the multi-dimensional urban sensing in sparse MCS to jointly address the data inference and cell selection for multi-task scenarios. We exploit the intra-and inter-task correlations in data inference to deduce the data of the unsensed cells through the multi-task compressive sensing and then learn and select the most effective cell, task pairs by using reinforcement learning. To effectively capture the intra-and inter-task correlations in cell selection, we design a network structure with multiple branches, where branches extract the intra-task correlations for each task, respectively, and then catenates the results from all branches to capture the inter-task correlations among the multiple tasks. In addition, we present a two-stage online framework for reinforcement learning in practical use, including training and running phases. The extensive experiments have been conducted on two real-world urban sensing datasets, each with two types of sensing data, which verify the effectiveness of our proposed algorithms on multi-dimensional urban sensing and achieve better performances than the state-of-the-art mechanisms

Novel Internet of Vehicles Approaches for Smart Cities

Smart cities are the domain where many electronic devices and sensors transmit data via the Internet of Vehicles concept. The purpose of deploying many sensors in cities is to provide an intelligent environment and a good quality of life. However, different challenges still appear in smart cities such as vehicular traffic congestion, air pollution, and wireless channel communication aspects. Therefore, in order to address these challenges, this thesis develops approaches for vehicular routing, wireless channel congestion alleviation, and traffic estimation. A new traffic congestion avoidance approach has been developed in this thesis based on the simulated annealing and TOPSIS cost function. This approach utilizes data such as the traffic average travel speed from the Internet of Vehicles. Simulation results show that the developed approach improves the traffic performance for the Sheffield the scenario in the presence of congestion by an overall average of 19.22% in terms of travel time, fuel consumption and CO2 emissions as compared to other algorithms. In contrast, transmitting a large amount of data among the sensors leads to a wireless channel congestion problem. This affects the accuracy of transmitted information due to the packets loss and delays time. This thesis proposes two approaches based on a non-cooperative game theory to alleviate the channel congestion problem. Therefore, the congestion control problem is formulated as a non-cooperative game. A proof of the existence of a unique Nash equilibrium is given. The performance of the proposed approaches is evaluated on the highway and urban testing scenarios. This thesis also addresses the problem of missing data when sensors are not available or when the Internet of Vehicles connection fails to provide measurements in smart cities. Two approaches based on l1 norm minimization and a relevance vector machine type optimization are proposed. The performance of the developed approaches has been tested involving simulated and real data scenarios