This work proposes the use of Information Theory for the characterization of vehicles behavior through their velocities. Three public data sets were used: (i) Mobile Century data set collected on Highway I-880, near Union City, California; (ii) Borlange GPS data set collected in the Swedish city of Borlange; and (iii) Beijing taxicabs data set collected in Beijing, China, where each vehicle speed is stored as a time series. The Bandt-Pompe methodology combined with the Complexity-Entropy plane were used to identify different regimes and behaviors. The global velocity is compatible with a correlated noise with f − k Power Spectrum with k ≥ 0. With this we identify traffic behaviors as, for instance, random velocities (k ≃ 0) when there is congestion, and more correlated velocities (k ≃ 3) in the presence of free traffic flow. Copyright EDP Sciences, SIF, Springer-Verlag Berlin Heidelberg 2015
@cite_35 characterized time series of vehicle velocities using Complex Networks. They transformed the time series into a new series based on the reconstruction of the phase space. Then, complex networks of traffic flow were built and analyzed considering the degree distribution, density, and clustering coefficient. The results detected that the networks present communities structures, i.e., the nodes of the networks are grouped so that each group is highly connected. The data set used was collected in the city of Harbin, China, during one complete day with sampling at 2 , resulting in @math samples.
@cite_35
2058532765
A complex network is a powerful tool to research complex systems, traffic flow being one of the most complex systems. In this paper, we use complex network theory to study traffic time series, which provide a new insight into traffic flow analysis. Firstly, the phase space, which describes the evolution of the behavior of a nonlinear system, is reconstructed using the delay embedding theorem. Secondly, in order to convert the new time series into a complex network, the critical threshold is estimated by the characteristics of a complex network, which include degree distribution, cumulative degree distribution, and density and clustering coefficients. We find that the degree distribution of associated complex network can be fitted with a Gaussian function, and the cumulative degree distribution can be fitted with an exponential function. Density and clustering coefficients are then researched to reflect the change of connections between nodes in complex network, and the results are in accordance with the observation of the plot of an adjacent matrix. Consequently, based on complex network analysis, the proper range of the critical threshold is determined. Finally, to mine the nodes with the closest relations in a complex network, the modularity is calculated with the increase of critical threshold and the community structure is detected according to the optimal modularity. The work in our paper provides a new way to understand the dynamics of traffic time series.