Search

This paper proposes a convolutional neural network (CNN) model of the signal distribution control algorithm (SDCA) to maximize the dynamic vehicular traffic signal flow for each junction phase. The aim of the proposed algorithm is to determine the reward value and new state. It deconstructs the routing components of the current multi-directional queuing system (MDQS) architecture to identify optimal policies for every traffic scenario. Initially, the state value is divided into a function value and a parameter value. Combining these two scenarios updates the resulting optimized state value. Ultimately, an analogous criterion is developed for the current dataset. Next, the error or loss value for the present scenario is computed. Furthermore, utilizing the Deep Q-learning methodology with a quad agent enhances previous study discoveries. The recommended method outperforms all other traditional approaches in effectively optimizing traffic signal timing. [ABSTRACT FROM AUTHOR]

With the increasing number of urban vehicles, as well as the current situation of non-intelligent traffic control systems, spatiotemporal non-uniform traffic resource occupation, and limited traffic planning and design, existing urban traffic planning methods cannot effectively solve problems such as frequent traffic congestion and uncontrollable commuting time for residents. In order to solve the above problems, this paper first constructs a multi-queue, multi-server queuing model based on the server vacation and a multi-hop cascaded queuing model from the perspective of local intersections and global commuting paths. We analyze the theoretical changes in passage delay costs at local intersections and on global commuting paths as a function of traffic flow and the random duration of traffic signals. On this basis, this article proposes a collaborative intelligent traffic planning algorithm based on artificial intelligence, which utilizes traffic sensors to dynamically perceive traffic congestion status and collaboratively plans the optimal duration of traffic signals and the optimal driving path of vehicles from both local and global perspectives, thereby maximizing the on-time arrival ratio of vehicles while ensuring the required commuting delay. The simulation results show that the proposed method can increase the on-time arrival ratio of vehicles by at least 20% compared to contrast methods while meeting the requirements relating to commuting delays. This verifies that our method can provide support for the improvement in efficiency in future Internet of vehicles. [ABSTRACT FROM AUTHOR]

As urban areas continue to expand, traffic congestion has emerged as a significant challenge impacting urban governance and economic development. Frequent regional traffic congestion has become a primary factor hindering urban economic growth and social activities, necessitating improved regional traffic management. Addressing regional traffic optimization and control methods based on the characteristics of regional congestion has become a crucial and complex issue in the field of traffic management and control research. This paper focuses on the macroscopic fundamental diagram (MFD) and aims to tackle the control problem without relying on traffic determination information. To address this, we introduce the Q-learning (QL) algorithm in reinforcement learning and the Deep Deterministic Policy Gradient (DDPG) algorithm in deep reinforcement learning. Subsequently, we propose the MFD-QL perimeter control model and the MFD-DDPG perimeter control model. We conduct numerical analysis and simulation experiments to verify the effectiveness of the MFD-QL and MFD-DDPG algorithms. The experimental results show that the algorithms converge rapidly to a stable state and achieve superior control effects in optimizing regional perimeter control. [ABSTRACT FROM AUTHOR]

Traffic flow prediction is one of the most important tasks of the Intelligent Transportation Systems (ITSs) for traffic management, and it is also a challenging task affected by many complex factors, such as weather and time. Many cities adopt efficient traffic prediction methods to control traffic congestion. However, most of the existing methods of traffic prediction focus on urban road scenarios, neglecting the complexity of multivariate auxiliary information in highways. Moreover, these methods have difficulty explaining the prediction results based only on the historical traffic flow sequence. To tackle these problems, we propose a novel traffic prediction model, namely Multi-variate and Multi-horizon prediction based on Long Short-Term Memory (MMLSTM). MMLSTM can effectively incorporate auxiliary information, such as weather and time, based on a strategy of multi-horizon time spans to improve the prediction performance. Specifically, we first exploit a multi-horizon bidirectional LSTM model for fusing the multivariate auxiliary information in different time spans. Then, we combine an attention mechanism and multi-layer perceptron to conduct the traffic prediction. Furthermore, we can use the information of multivariate (weather and time) to provide interpretability to manage the model. Comprehensive experiments are conducted on Hangst and Metr-la datasets, and MMLSTM achieves better performance than baselines on traffic prediction tasks. [ABSTRACT FROM AUTHOR]

The rapid growth of industry and the economy has contributed to a tremendous increase in traffic in all urban areas. People face the problem of traffic congestion frequently in their day-to-day life. To alleviate congestion and provide traffic guidance and control, several types of research have been carried out in the past to develop suitable computational models for short- and long-term traffic. This study developed an effective multi-dimensional dataset-based model in cyber–physical systems for more accurate traffic-volume prediction. The integration of quantum convolutional neural network and Bayesian optimization (QCNN_BaOpt) constituted the proposed model in this study. Furthermore, optimal tuning of hyperparameters was carried out using Bayesian optimization. The constructed model was evaluated using the US accident dataset records available in Kaggle, which comprise 1.5 million records. The dataset consists of 47 attributes describing spatial and temporal behavior, accidents, and weather characteristics. The efficiency of the proposed model was evaluated by calculating various metrics. The performance of the proposed model was assessed as having an accuracy of 99.3%. Furthermore, the proposed model was compared against the existing state-of-the-art models to demonstrate its superiority. [ABSTRACT FROM AUTHOR]

Accurately forecasting the demand of urban online car-hailing is of great significance to improving operation efficiency, reducing traffic congestion and energy consumption. This paper takes 265-day order data from the Hefei urban online car-hailing platform from 2019 to 2021 as an example, and divides each day into 48 time units (30 min per unit) to form a data set. Taking the minimum average absolute error as the optimization objective, the historical data sets are classified, and the values of the state vector T and the parameter K of the K-nearest neighbor model are optimized, which solves the problem of prediction error caused by fixed values of T or K in traditional model. The conclusion shows that the forecasting accuracy of the K-nearest neighbor model can reach 93.62%, which is much higher than the exponential smoothing model (81.65%), KNN1 model (84.02%) and is similar to LSTM model (91.04%), meaning that it can adapt to the urban online car-hailing system and be valuable in terms of its potential application. [ABSTRACT FROM AUTHOR]

Adaptive traffic signal control (ATSC) is an effective method to reduce traffic congestion in modern urban areas. Many studies adopted various approaches to adjust traffic signal plans according to real-time traffic in response to demand fluctuations to improve urban network performance (e.g., minimise delay). Recently, learning-based methods such as reinforcement learning (RL) have achieved promising results in signal plan optimisation. However, adopting these self-learning techniques in future traffic environments in the presence of connected and automated vehicles (CAVs) remains largely an open challenge. This study develops a real-time RL-based adaptive traffic signal control that optimises a signal plan to minimise the total queue length while allowing the CAVs to adjust their speed based on a fixed timing strategy to decrease total stop delays. The highlight of this work is combining a speed guidance system with a reinforcement learning-based traffic signal control. Two different performance measures are implemented to minimise total queue length and total stop delays. Results indicate that the proposed method outperforms a fixed timing plan (with optimal speed advisory in a CAV environment) and traditional actuated control, in terms of average stop delay of vehicle and queue length, particularly under saturated and oversaturated conditions. [ABSTRACT FROM AUTHOR]

With the development of Internet of Things infrastructures and intelligent traffic systems, the traffic congestion that results from the continuous complexity of urban road networks and traffic saturation has a new solution. In this research, we propose a traffic signal control scenario based on edge computing. We also propose a chemical reaction–cooperative particle swarm optimization (CRO-CPSO) algorithm so that flexible traffic control is sunk to the edge. To implement short-term real-time vehicle waiting time prediction as a collaborative judgment of CRO-CPSO, we suggest a traffic flow prediction system based on fuzzy logic. In addition, we introduce a co-factor (collaborative factor) set based on offline learning to take into account the experiential characteristics of intersections in urban road networks for the generation of strategies by the algorithm. Furthermore, the real case of Changsha County is simulated on the SUMO simulation platform. The issue of traffic flow saturation is improved by our method. Compared with other methods, our algorithm enhances the proportions of vehicles that reach their destinations on time by 13.03%, which maximizes the driving experience for drivers. Meanwhile, our algorithm reduces the driving times of vehicles by 25.34%, thus alleviating traffic jams. [ABSTRACT FROM AUTHOR]

Due to the limitations of data transfer technologies, existing studies on urban traffic control mainly focused on isolated dimension control such as traffic signal control or vehicle route guidance to alleviate traffic congestion. However, in real traffic, the distribution of traffic flow is the result of multiple dimensions whose future state is influenced by each dimension's decisions. Presently, the development of the Internet of Vehicles enables an integrated intelligent transportation system. This paper proposes an integrated intelligent transportation model that can optimize predictive traffic signal control and predictive vehicle route guidance simultaneously to alleviate traffic congestion based on their feedback regulation relationship. The challenges of this model lie in that the formulation of the nonlinear feedback relationship between various dimensions is hard to describe and the design of a corresponding solving algorithm that can obtain Pareto optimality for multi-dimension control is complex. In the integrated model, we introduce two medium variables—predictive traffic flow and the predictive waiting time—to two-way link the traffic signal control and vehicle route guidance. Inspired by game theory, an asymmetric information exchange framework-based updating distributed algorithm is designed to solve the integrated model. Finally, an experimental study in two typical traffic scenarios shows that more than 73.33% of the considered cases adopting the integrated model achieve Pareto optimality. [ABSTRACT FROM AUTHOR]

Traffic congestion experience in urban areas has negative impact on our daily lives by consuming our time and resources. Intelligent Transportation Systems can provide the necessary infrastructure to mitigate such challenges. In this paper, we propose a novel and scalable solution to model, store and control traffic data based on range query data structures (K-ary Interval Tree and K-ary Entry Point Tree) which allows data representation and handling in a way that better predicts and avoids traffic congestion in urban areas. Our experiments, validation scenarios, performance measurements and solution assessment were done on Brooklyn, New York traffic congestion simulation scenario and shown the validity, reliability, performance and scalability of the proposed solution in terms of time spent in traffic, run-time and memory usage. The experiments on the proposed data structures simulated up to 10,000 vehicles having microseconds time to access traffic information and below 1.5 s for congestion free route generation in complex scenarios. To the best of our knowledge, this is the first scalable approach that can be used to predict urban traffic and avoid congestion through range query data structure traffic modelling. [ABSTRACT FROM AUTHOR]