Controller design for gating traffic control in presence of time-delay in urban road networks

Recent studies demonstrated the efficiency of feedback-based gating control in mitigating congestion in urban networks by exploiting the notion of macroscopic or network fundamental diagram (MFD or NFD). The employed feedback regulator of proportional-integral (PI)-type targets an operating NFD point of maximum throughput to enhance the mobility in the urban road network during the peak period, under saturated traffic conditions. In previous studies, gating was applied directly at the border of the protected network (PN), i.e. the network part to be protected from over-saturation. In this work, the recently developed feedback-based gating concept is applied at junctions located further upstream of the PN. This induces a time-delay, which corresponds to the travel time needed for gated vehicles to approach the PN. The resulting extended feedback control problem can be also tackled by use of a PI-type regulator, albeit with different gain values compared to the case without time-delay. Detailed procedures regarding the appropriate design of related feedback regulators are provided. In addition, the developed feedback concept is shown to work properly with very long time-steps as well. A large part of the Chania, Greece, urban network, modelled in a microscopic simulation environment under realistic traffic conditions, is used as test-bed in this study. The reported results demonstrate a stable and efficient behaviour and improved mobility of the overall network in terms of mean speed and travel time.     

An analytical approximation for the macroscopic fundamental diagram of urban traffic

This paper shows that a macroscopic fundamental diagram (MFD) relating average flow and average density must exist on any street with blocks of diverse widths and lengths, but no turns, even if all or some of the intersections are controlled by arbitrarily timed traffic signals. The timing patterns are assumed to be fixed in time. Exact analytical expressions in terms of a shortest path recipe are given, both, for the street’s capacity and its MFD. Approximate formulas that require little data are also given.For networks, the paper derives an upper bound for average flow conditional on average density, and then suggests conditions under which the bound should be tight; i.e., under which the bound is an approximate MFD. The MFD’s produced with this method for the central business districts of San Francisco (California) and Yokohama (Japan) are compared with those obtained experimentally in earlier publications.     

Recent developments in traffic flow modeling using macroscopic fundamental diagram

ABSTRACT

This paper presents an overview of the recent developments in traffic flow modelling and analysis using macroscopic fundamental diagram (MFD) as well as their applications. In recent literature, various aggregated traffic models have been proposed and studied to analyse traffic flow while enhancing network efficiency. Many of these studies have focused on models based on MFD that describes the relationship between aggregated flow and aggregated density of transport networks. The analysis of MFD has been carried out based on experimental data collected from sensors and GPS, as well as simulation models. Several factors are found to influence the existence and shape of MFD, including traffic demand, network and signal settings, and route choices. As MFD can well express the traffic dynamics of large urban transport networks, it has been extensively applied to traffic studies, including the development of network-wide control strategies, network partitioning, performance evaluation, and road pricing. This work also presents future extensions and research directions for MFD-based traffic modelling and applications.     

A three-dimensional macroscopic fundamental diagram for mixed bi-modal urban networks

Recent research has studied the existence and the properties of a macroscopic fundamental diagram (MFD) for large urban networks. The MFD should not be universally expected as high scatter or hysteresis might appear for some type of networks, like heterogeneous networks or freeways. In this paper, we investigate if aggregated relationships can describe the performance of urban bi-modal networks with buses and cars sharing the same road infrastructure and identify how this performance is influenced by the interactions between modes and the effect of bus stops. Based on simulation data, we develop a three-dimensional vehicle MFD (3D-vMFD) relating the accumulation of cars and buses, and the total circulating vehicle flow in the network. This relation experiences low scatter and can be approximated by an exponential-family function. We also propose a parsimonious model to estimate a three-dimensional passenger MFD (3D-pMFD), which provides a different perspective of the flow characteristics in bi-modal networks, by considering that buses carry more passengers. We also show that a constant Bus–Car Unit (BCU) equivalent value cannot describe the influence of buses in the system as congestion develops. We then integrate a partitioning algorithm to cluster the network into a small number of regions with similar mode composition and level of congestion. Our results show that partitioning unveils important traffic properties of flow heterogeneity in the studied network. Interactions between buses and cars are different in the partitioned regions due to higher density of buses. Building on these results, various traffic management strategies in bi-modal multi-region urban networks can then be integrated, such as redistribution of urban space among different modes, perimeter signal control with preferential treatment of buses and bus priority.     

A model‐based demand‐balancing control for dynamically divided multiple urban subnetworks

Traffic control is an effective and efficient method for the problem of traffic congestion. It is necessary to design a high‐level controller to regulate the network traffic demands, because traffic congestion is not only caused by the improper management of the traffic network but also to a great extent caused by excessive network traffic demands. Therefore, we design a demand‐balance model predictive controller based on the macroscopic fundamental diagram‐based multi‐subnetwork model, which can optimize the network traffic mobility and the network traffic throughput by regulating the input traffic flows of the subnetworks. Because the transferring traffic flows among subnetworks are indirectly controlled and coordinated by the demand‐balance model predictive controller, the subnetwork division can variate dynamically according to real traffic states, and a global optimality can be achieved for the entire traffic network. The simulation results show the effectiveness of the proposed controller in improving the network traffic throughput. Copyright © 2016 John Wiley & Sons, Ltd.     

Agent-based network transmission model using the properties of macroscopic fundamental diagram

The field of research that has recently come to the fore is the perimeter control, which aims to control traffic demand for a large urban area prior to controlling internal flow inside the area. Such control concept needs to be tested by simulations, hence, it is necessary to develop a model that can appropriately estimate the network-wide flow dynamics. In this paper, agent-based network transmission model (ANTM) is proposed for describing the aggregated flow dynamics over an urban area of multiple large-scale networks. The proposed model is the combination of the cell transmission model (CTM), macroscopic fundamental diagram (MFD), and agent concept. The CTM-based simulation is adopted for the simplicity considering the computation requirements for real-time feasibility. The MFD concept is applied for representing the network properties, and a new approach is taken particularly for estimating network outflow affected by both demand patterns and boundary capacity. The agent concept is applied for representing drivers’ travel behaviors. The model is compared with microscopic simulations and shows reasonable accuracy for large areas. In addition, various travel direction choice behaviors are applicable to this model. Various perimeter control policies are applicable as well, thus, the proposed model can be a useful tool for testing various control methods, in terms of reducing the congestion in urban areas.     

Robust constrained control of uncertain macroscopic fundamental diagram networks

This paper considers modeling and control of uncertain Macroscopic Fundamental Diagram (MFD) systems for multiple-region networks. First, the nonlinear vehicle conservation equations based on MFD dynamics, presented in earlier publications, are transformed to linear equations with parameter uncertainties. The parameter uncertainties include the destination decomposition fractions, that are difficult to estimate in reality. Then, the uncertain linear model is utilized to design a robust feedback controller by an interpolation-based approach. This approach (i) guarantees robustness against all parameter uncertainties, (ii) handle control and state constraints, and (iii) present a computationally cheap solution. The main idea is to interpolate between (i) a stabilizing outer controller that respects the control and state constraints and (ii) an inner robustly stable controller designed by any method. The robust control is further challenged to deal with different relative locations of reference accumulation points on the MFD diagrams. Numerical results for a two-region system show that the uncertain linear model can replace the nonlinear model for modeling and control. Moreover, the robust control law is presented as implicit and explicit solutions, where in the implicit case one linear programming (LP) problem is solved at each time instant, while in the explicit case, the control law is shown as a piecewise affine function of state. Finally, a comparison between the interpolating controller and other controllers in the literature is carried out. The results demonstrate the performance advantages from applying the robust interpolating controller.     

Properties of a well-defined macroscopic fundamental diagram for urban traffic

A field experiment in Yokohama (Japan) revealed that a macroscopic fundamental diagram (MFD) linking space-mean flow, density and speed exists on a large urban area. It was observed that when the highly scattered plots of flow vs. density from individual fixed detectors were aggregated the scatter nearly disappeared and points grouped along a well defined curve. Despite these and other recent findings for the existence of well-defined MFDs for urban areas, these MFDs should not be universally expected. In this paper we investigate what are the properties that a network should satisfy, so that an MFD with low scatter exists. We show that the spatial distribution of vehicle density in the network is one of the key components that affect the scatter of an MFD and its shape. We also propose an analytical derivation of the spatial distribution of congestion that considers correlation between adjacent links. We investigate the scatter of an MFD in terms of errors in the probability density function of spatial link occupancy and errors of individual links’ fundamental diagram (FD). Later, using real data from detectors for an urban arterial and a freeway network we validate the proposed derivations and we show that an MFD is not well defined in freeway networks as hysteresis effects are present. The datasets in this paper consist of flow and occupancy measures from 500 fixed sensors in the Yokohama downtown area in Japan and 600 loop detectors in the Twin Cities Metropolitan Area Freeway network in Minnesota, USA.     

Automatic calibration of fundamental diagram for first‐order macroscopic freeway traffic models

Despite its importance in macroscopic traffic flow modeling, comprehensive method for the calibration of fundamental diagram is very limited. Conventional empirical methods adopt a steady state analysis of the aggregate traffic data collected from measurement devices installed on a particular site without considering the traffic dynamics, which renders the simulation may not be adaptive to the variability of data. Nonetheless, determining the fundamental diagram for each detection site is often infeasible. To remedy these, this study presents an automatic calibration method to estimate the parameters of a fundamental diagram through a dynamic approach. Simulated flow from the cell transmission model is compared against the measured flow wherein an optimization merit is conducted to minimize the discrepancy between model‐generated data and real data. The empirical results prove that the proposed automatic calibration algorithm can significantly improve the accuracy of traffic state estimation by adapting to the variability of traffic data when compared with several existing methods under both recurrent and abnormal traffic conditions. Results also highlight the robustness of the proposed algorithm. The automatic calibration algorithm provides a powerful tool for model calibration when freeways are equipped with sparse detectors, new traffic surveillance systems lack of comprehensive traffic data, or the case that lots of detectors lose their effectiveness for aging systems. Furthermore, the proposed method is useful for off‐line model calibration under abnormal traffic conditions, for example, incident scenarios. Copyright © 2015 John Wiley & Sons, Ltd.     

Exploiting the fundamental diagram of urban networks for feedback-based gating

Traffic signal control for urban road networks has been an area of intensive research efforts for several decades, and various algorithms and tools have been developed and implemented to increase the network traffic flow efficiency. Despite the continuous advances in the field of traffic control under saturated conditions, novel and promising developments of simple concepts in this area remains a significant objective, because some proposed approaches that are based on various meta-heuristic optimization algorithms can hardly be used in a real-time environment. To address this problem, the recently developed notion of network fundamental diagram for urban networks is exploited to improve mobility in saturated traffic conditions via application of gating measures, based on an appropriate simple feedback control structure. As a case study, the proposed methodology is applied to the urban network of Chania, Greece, using microscopic simulation. The results show that the total delay in the network decreases significantly and the mean speed increases accordingly.     

Marginal cost congestion pricing based on the network fundamental diagram

Congestion pricing schemes have been traditionally derived based on analytical representations of travel demand and traffic flows, such as in bottleneck models. A major limitation of these models, especially when applied to urban networks, is the inconsistency with traffic dynamics and related phenomena such as hysteresis and the capacity drop. In this study we propose a new method to derive time-varying tolling schemes using the concept of the Network Fundamental Diagram (NFD). The adopted method is based on marginal cost pricing, while it also enables to account realistically for the dynamics of large and heterogeneous traffic networks. We derive two alternative cordon tolls using network-aggregated traffic flow conditions: a step toll that neglects the spatial distribution of traffic by simply associating the marginal costs of any decrease in production within the NFD to the surplus of traffic; and a step toll that explicitly accounts for how network performance is also influenced by the spatial variance in a 3D-NFD. This pricing framework is implemented in the agent-based simulation model MATSim and applied to a case study of the city of Zurich. The tolling schemes are compared with a uniform toll, and they highlight how the inhomogeneous distribution of traffic may compromise the effectiveness of cordon tolls.     

A sensitivity-based approach for adaptive decomposition of anticipatory network traffic control

Anticipatory optimal network control is defined as the problem of determining the set of control actions that minimizes a network-wide objective function. This not only takes into account local consequences on the propagation of flows, but also the global network-wide routing behavior of the users. Such an objective function is, in general, defined in a centralized setting, as knowledge regarding the whole network is needed to correctly compute it. Reaching a level of centralization sufficient to attain network-wide control objectives is however rarely realistic in practice. Multiple authorities are influencing different portions the network, separated either hierarchically or geographically. The distributed nature of networks and traffic directly influences the complexity of the anticipatory control problem.This is our motivation for this work, in which we introduce a decomposition mechanism for the global anticipatory network traffic control problem, based on dynamic clustering of traffic controllers. Rather than solving the full centralized problem, or blindly performing a full controller-wise decomposition, this technique allows recognizing when and which controllers should be grouped in clusters, and when, instead, these can be optimized separately.The practical relevance with respect to our motivation is that our approach allows identification of those network traffic conditions in which multiple actors need to actively coordinate their actions, or when unilateral action suffices for still approximating global optimality.This clustering procedure is based on well-known algebraic and statistical tools that exploit the network’s sensitivity to control and its structure to deduce coupling behavior. We devise several case studies in order to assess our newly introduced procedure’s performances, in comparison with fully decomposed and fully centralized anticipatory optimal network control, and show that our approach is able to outperform both centralized and decomposed procedures.     

The evolution of urban traffic control: changing policy and technology

Abstract

The history of urban traffic control (UTC) throughout the past century has been a continued race to keep pace with ever more complex policy objectives and consistently increasing vehicle demand. Many benefits can be observed from an efficient UTC system, such as reduced congestion, increased economic efficiency and improved road safety and air quality.

There have been significant advances in vehicle detection and communication technologies which have enabled a series of step changes in the capabilities of UTC systems, from early (fixed time) signal plans to modern integrated systems. A variety of UTC systems have been implemented throughout the world, each with individual strengths and weaknesses; this paper seeks to compare the leading commercial systems (and some less well known systems) to highlight the key characteristics and differences before assessing whether the current UTC systems are capable of meeting modern transport policy obligations and desires.

This paper then moves on to consider current and future transport policy and the technological landscape in which UTC will need to operate over the coming decades, where technological advancements are expected to move UTC from an era of limited data availability to an era of data abundance.     

On development of arterial fundamental diagrams based on surrogate density measures from adaptive traffic control systems utilizing stop-line detection

A promising framework for understanding flow-density relationship in traffic flow theory is the Fundamental Diagram, originally developed for uninterrupted traffic flow facilities. The concept has been extended to the Arterial Fundamental Diagram (AFD), which has shown that the same relationship holds on arterial streets. However, constructing an AFD is subject to considerable variability in the measured quantities, due to the highly cyclical nature of signalized intersections. In most cases, these diagrams are based on the data from upstream detectors, located away from traffic signals. Recent scientific literature has shown a value of using stop-line detection data to develop AFDs, opening a plethora of opportunities to further investigate traffic dynamics utilizing the data from adaptive traffic control systems (ATCSs). This can, however, be problematic for two major reasons. First, the data may come from detectors unfit to provide good-quality inputs to develop an AFD. Second, such ATCSs may use their own surrogate measures of density and traffic flow, primarily developed for the purpose of controlling traffic, which may be inappropriate for developing fundamental relationships. This study aims to address these issues by investigating appropriateness of using Degree of Saturation (DS), a density-like measure from Sydney Coordinated Adaptive Traffic System (SCATS), to develop an AFD. Empirical SCATS data shows an interesting pattern of the AFD, which cannot be explained by the data itself. Hence, we derive a new analytical model of DS based on the high-resolution signal and detection data, which reveals parameters that drive its behavior. Additionally, we develop the Cyclical Vehicle Arrival and Discharge Model to simulate SCATS-like operations and derive causal relationships between traffic flow variables and density-like performance measures in a controlled environment. The findings show that DS does not have to be a poor estimator of traffic conditions, but when it is combined with SCATS-measured traffic flows it gives a false representation of near-capacity and over-saturated conditions.     

An extended coordinate descent method for distributed anticipatory network traffic control

Anticipatory optimal network control can be defined as the practice of determining the set of control actions that minimizes a network-wide objective function, so that the consequences of this action are taken in consideration not only locally, on the propagation of flows, but globally, taking into account the user’s routing behavior. Such an objective function is, in general, defined and optimized in a centralized setting, as knowledge regarding the whole network is needed in order to correctly compute it. This is a strong theoretical framework but, in practice, reaching a level of centralization sufficient to achieve said optimality is very challenging. Furthermore, even if centralization was possible, it would exhibit several shortcomings, with concerns such as computational speed (centralized optimization of a huge control set with a highly nonlinear objective function), reliability and communication overhead arising.The main aim of this work is to develop a decomposed heuristic descent algorithm that, demanding the different control entities to share the same information set, attains network-wide optimality through separate control actions.     

On the fundamental diagram and supply curves for congested urban networks

Macroscopic fundamental diagrams (MFD) of traffic for some networks have been shown to have similar shape to those for single links. They have erroneously been used to help estimate the level of travel in congested networks. We argue that supply curves, which track vehicles in their passage through congested networks, are needed for this purpose, and that they differ from the performance curves generated from MFD. We use a microsimulation model, DRACULA and two networks, one synthesizing the network for Cambridge, England, and one of the city of York, England, to explore the nature of performance curves and supply curves under differing patterns of demand.We show that supply curves differ from performance curves once the onset of congestion is reached, and that the incorrect use of performance curves to estimate demand can thus seriously underestimate traffic levels, the costs of congestion, and the value of congestion relief measures. We also show that network aggregated supply curves are sensitive to the temporal distribution of demand and, potentially, to the spatial distribution of demand. The shape of the supply curve also differs between origin–destination movements within a given network.We argue that supply curves for higher levels of demand cannot be observed in normal traffic conditions, and specify ways in which they can be determined from microsimulation and, potentially, by extrapolating observed data. We discuss the implications of these findings for conventional modelling of network management policies, and for these policies themselves.     

Area-wide urban traffic control: A Bee Colony Optimization approach

The paper describes a new method of optimizing traffic signal settings. The area-wide urban traffic control system developed in the paper is based on the Bee Colony Optimization (BCO) technique. The BCO method is based on the principles of the collective intelligence applied by the honeybees during the nectar collecting process. The optimal (or near-optimal) values of cycle length, offsets, and splits are discovered by minimizing the total travel time of all network users travelling through signalized intersections. The set of numerical experiments is performed on well-known traffic benchmark network. The results obtained by the BCO approach are compared with the results found by Simulated Annealing (SA). It has been shown that the suggested BCO approach outperformed the SA.     

Exploring the issue of integrating logistics and traffic control in urban areas

This paper proposes an optimization framework for urban transportation networks’ (re-)design which explicitly takes into account the specific decision-making processes of ordinary users and logistic operators. Ordinary users are typically commuters whose travels consist of well-defined pairs of origin and destination points, while logistic operators make deliveries at multiple locations. Obviously, these two user classes have different objectives and scopes of action. These differences are seldom considered in traffic research since most models aggregate the flow demand in OD matrices and use assignment models to predict the response of all users as if the dynamics of their optimization processes were of the same nature. This work demonstrates that better results can be achieved if the particular features of each user class are included in the models. It potentially improves the estimation of the responses and allows managers to shape their control measures to address specific user needs.     

Privacy protection method for fine-grained urban traffic modeling using mobile sensors

With the ubiquitous nature of mobile sensing technologies, privacy issues are becoming increasingly important, and need to be carefully addressed. Data needs for transportation modeling and privacy protection should be deliberately balanced for different applications. This paper focuses on developing privacy mechanisms that would simultaneously satisfy privacy protection and data needs for fine-grained urban traffic modeling applications using mobile sensors. To accomplish this, a virtual trip lines (VTLs) zone-based system and related filtering approaches are developed. Traffic-knowledge-based adversary models are proposed and tested to evaluate the effectiveness of such a privacy protection system by making privacy attacks. The results show that in addition to ensuring an acceptable level of privacy, the released datasets from the privacy-enhancing system can also be applied to urban traffic modeling with satisfactory results. Albeit application-specific, such a “Privacy-by-Design” approach would hopefully shed some light on other transportation applications using mobile sensors.     

On the fundamental diagram for freeway traffic: A novel calibration approach for single-regime models

The speed-density or flow-density relationship has been considered as the foundation of traffic flow theory. Existing single-regime models calibrated by the least square method (LSM) could not fit the empirical data consistently well both in light-traffic/free-flow conditions and congested/jam conditions. In this paper, first, we point out that the inaccuracy of single-regime models is not caused solely by their functional forms, but also by the sample selection bias. Second, we apply a weighted least square method (WLSM) that addresses the sample selection bias problem. The calibration results for six well-known single-regime models using the WLSM fit the empirical data reasonably well both in light-traffic/free-flow conditions and congested/jam conditions. Third, we conduct a theoretical investigation that reveals the deficiency associated with the LSM is because the expected value of speed (or a function of it) is nonlinear with regard to the density (or a function of it).