Intersection SPaT Estimation by means of Single-Source Connected Vehicle Data

The file attached to this record is the author's final peer reviewed version.Current traffic management systems in urban networks require real-time estimation of the traffic states. With the development of in-vehicle and communication technologies, connected vehicle data has emerged as a new data source for traffic measurement and estimation. In this work, a machine learning-based methodology for signal phase and timing information (SPaT) which is highly valuable for many applications such as green light optimal advisory systems and real-time vehicle navigation is proposed. The proposed methodology utilizes data from connected vehicles travelling within urban signalized links to estimate the queue tail location, vehicle accumulation, and subsequently, link outflow. Based on the produced high-resolution outflow estimates and data from crossing connected vehicles, SPaT information is estimated via correlation analysis and a machine learning approach. The main contribution is that the single-source proposed approach relies merely on connected vehicle data and requires neither prior information such as intersection cycle time nor data from other sources such as conventional traffic measuring tools. A sample four-leg intersection where each link comprises different number of lanes and experiences different traffic condition is considered as a testbed. The validation of the developed approach has been undertaken by comparing the produced estimates with realistic micro-simulation results as ground truth, and the achieved simulation results are promising even at low penetration rates of connected vehicles

Derivation of a Fundamental Diagram for Urban Traffic Flow

Despite the importance of urban traffic flows, there are only a few theoretical approaches to determine fundamental relationships between macroscopic traffic variables such as the traffic density, the utilization, the average velocity, and the travel time. In the past, empirical measurements have primarily been described by fit curves. Here, we derive expected fundamental relationships from a model of traffic flows at intersections, which suggest that the recently measured fundamental diagrams for urban flows can be systematically understood. In particular, this allows one to derive the average travel time and the average vehicle speed as a function of the utilization and/or the average number of delayed vehicles.Comment: For related work, see http://www.helbing.or

Optimised Traffic Flow at a Single Intersection: Traffic Responsive signalisation

We propose a stochastic model for the intersection of two urban streets. The vehicular traffic at the intersection is controlled by a set of traffic lights which can be operated subject to fix-time as well as traffic adaptive schemes. Vehicular dynamics is simulated within the framework of the probabilistic cellular automata and the delay experienced by the traffic at each individual street is evaluated for specified time intervals. Minimising the total delay of both streets gives rise to the optimum signalisation of traffic lights. We propose some traffic responsive signalisation algorithms which are based on the concept of cut-off queue length and cut-off density.Comment: 10 pages, 11 eps figs, to appear in J. Phys.

A Review of Traffic Signal Control.

The aim of this paper is to provide a starting point for the future research within the SERC sponsored project "Gating and Traffic Control: The Application of State Space Control Theory". It will provide an introduction to State Space Control Theory, State Space applications in transportation in general, an in-depth review of congestion control (specifically traffic signal control in congested situations), a review of theoretical works, a review of existing systems and will conclude with recommendations for the research to be undertaken within this project

An MDP decomposition approach for traffic control at isolated signalized intersections

This article presents a novel approach for the dynamic control of a signalized intersection. At the intersection, there is a number of arrival flows of cars, each having a single queue (lane). The set of all flows is partitioned into disjoint combinations of nonconflicting flows that will receive green together. The dynamic control of the traffic lights is based on the numbers of cars waiting in the queues. The problem concerning when to switch (and which combination to serve next) is modeled as a Markovian decision process in discrete time. For large intersections (i.e., intersections with a large number of flows), the number of states becomes tremendously large, prohibiting straightforward optimization using value iteration or policy iteration. Starting from an optimal (or nearly optimal) fixed-cycle strategy, a one-step policy improvement is proposed that is easy to compute and is shown to give a close to optimal strategy for the dynamic proble