924 research outputs found
The price of anarchy in transportation networks by estimating user cost functions from actual traffic data
We have considered a large-scale road network in Eastern Massachusetts. Using real traffic data in the form of spatial average speeds and the flow capacity for each road segment of the network, we converted the speed data to flow data and estimated the origin-destination flow demand matrices for the network. Assuming that the observed traffic data correspond to user (Wardrop) equilibria for different times-of-the-day and days-of-the-week, we formulated appropriate inverse problems to recover the per-road cost (congestion) functions determining user route selection for each month and time-of-day period. In addition, we analyzed the sensitivity of the total user latency cost to important parameters such as road capacities and minimum travel times. Finally, we formulated a system-optimum problem in order to find socially optimal flows for the network. We investigated the network performance, in terms of the total latency, under a user-optimal policy versus a system-optimal policy. The ratio of these two quantities is defined as the Price of Anarchy (POA) and quantifies the efficiency loss of selfish actions compared to socially optimal ones. Our findings contribute to efforts for a smarter and more efficient city
Data-driven Estimation of Origin-Destination Demand and User Cost Functions for the Optimization of Transportation Networks
In earlier work (Zhang et al., 2016) we used actual traffic data from the
Eastern Massachusetts transportation network in the form of spatial average
speeds and road segment flow capacities in order to estimate Origin-Destination
(OD) flow demand matrices for the network. Based on a Traffic Assignment
Problem (TAP) formulation (termed "forward problem"), in this paper we use a
scheme similar to our earlier work to estimate initial OD demand matrices and
then propose a new inverse problem formulation in order to estimate user cost
functions. This new formulation allows us to efficiently overcome numerical
difficulties that limited our prior work to relatively small subnetworks and,
assuming the travel latency cost functions are available, to adjust the values
of the OD demands accordingly so that the flow observations are as close as
possible to the solutions of the forward problem. We also derive sensitivity
analysis results for the total user latency cost with respect to important
parameters such as road capacities and minimum travel times. Finally, using the
same actual traffic data from the Eastern Massachusetts transportation network,
we quantify the Price of Anarchy (POA) for a much larger network than that in
Zhang et al. (2016).Comment: Preprint submitted to The 20th World Congress of the International
Federation of Automatic Control, July 9-14, 2017, Toulouse, Franc
Detection and optimization problems with applications in smart cities
This dissertation proposes solutions to a selected set of detection and optimization problems, whose applications are focused on transportation systems. The goal is to help build smarter and more efficient transportation systems, hence smarter cities.
Problems with dynamics evolving in two different time-scales are considered:
(1) In a fast time-scale, the dissertation considers the problem of detection, especially statistical anomaly detection in real-time. From a theoretical perspective and under Markovian assumptions, novel threshold estimators are derived for the widely used Hoeffding test. This results in a test with a much better ability to control false alarms while maintaining a high detection rate. From a practical perspective, the improved test is applied to detecting non-typical traffic jams in the Boston road network using real traffic data reported by the Waze smartphone navigation application. The detection results can alert the drivers to reroute so as to avoid the corresponding areas and provide the most urgent "targets" to the Transportation department and/or emergency services to intervene and remedy the underlying cause resulting in these jams, thus, improving transportation systems and contributing to the smart city agenda.
(2) In a slower time-scale, the dissertation investigates a host of optimization problems, including estimation and adjustment of Origin-Destination (OD) demand, traffic assignment, recovery of travel cost functions, and joint recovery of travel cost functions and OD demand (joint problem). Integrating these problems leads to a data-driven predictive model which serves to diagnose/control/optimize the transportation network. To ensure good accuracy of the predictive model and increase its robustness and consistency, several novel formulations for the travel cost function recovery problem and the joint problem are proposed. A data-driven framework is proposed to evaluate the Price-of-Anarchy (PoA; a metric assessing the degree of congestion under selfish user-centric routing vs. socially-optimal system-centric routing). For the case where the PoA is larger than expected, three viable strategies are proposed to reduce it. To demonstrate the effectiveness and efficiency of the proposed approaches, case-studies are conducted on three benchmark transportation networks using synthetic data and an actual road network (from Eastern Massachusetts (EMA)) using real traffic data. Moreover, to facilitate research in the transportation community, the largest highway subnetwork of EMA has been released as a new benchmark network
The Green Choice: Learning and Influencing Human Decisions on Shared Roads
Autonomous vehicles have the potential to increase the capacity of roads via
platooning, even when human drivers and autonomous vehicles share roads.
However, when users of a road network choose their routes selfishly, the
resulting traffic configuration may be very inefficient. Because of this, we
consider how to influence human decisions so as to decrease congestion on these
roads. We consider a network of parallel roads with two modes of
transportation: (i) human drivers who will choose the quickest route available
to them, and (ii) ride hailing service which provides an array of autonomous
vehicle ride options, each with different prices, to users. In this work, we
seek to design these prices so that when autonomous service users choose from
these options and human drivers selfishly choose their resulting routes, road
usage is maximized and transit delay is minimized. To do so, we formalize a
model of how autonomous service users make choices between routes with
different price/delay values. Developing a preference-based algorithm to learn
the preferences of the users, and using a vehicle flow model related to the
Fundamental Diagram of Traffic, we formulate a planning optimization to
maximize a social objective and demonstrate the benefit of the proposed routing
and learning scheme.Comment: Submitted to CDC 201
Smart traffic control for the era of autonomous driving
This thesis aims to take on the challenges to address some of the key issues in traffic control and management, including intersection protocol design, congestion measurement, selfish routing and road infrastructure automation, under the assumption that all vehicles on the road are connected and self-driving. To design and test traffic control mechanisms for AVs, we introduced a formal model to represent road networks and traffic. Based on this model, we developed a simulation system on top of an existing open-source platform (AIM4) and used it to examine a number of traffic management protocols specifically designed for traffic with fully autonomous vehicles. Simulation outcomes show that traffic management protocols for AVs can be more subtle, sensitive and variable with traffic volumes/flow rate, vehicle safe distance and road configuration. In addition, by analyzing the real-world traffic data and simulation data, we found that measuring congestion with exponential functions has considerable advantages against the traditional BPR function in certain aspects. The deployment of autonomous vehicles provides traffic management with an opportunity of choosing either centralised control or decentralised control. The price of anarchy (PoA) of autonomous decision-making for routing gives an applicable quantitative criterion for selection between them. We extended the existing research on PoA with the ˙class of exponential functions as cost functions. We found an expression for the tight upper bound of the PoA for selfish routing games with exponential cost functions. Unlike existing studies, this upper bound depends on traffic demands, with which we can get a more accurate estimation of the PoA. Furthermore, by comparing the upper-bounds of PoA between the BPR function and the exponential function, we found that the exponential functions yield a smaller upper bound than the BPR functions in relatively low traffic flows. To specify traffic management systems with autonomous roadside facilities, we propose a hybrid model of traffic assignment. This model aims to describe traffic management systems in which both vehicles and roadside controllers make autonomous decisions, therefore, are autonomous agents. We formulated a non-linear optimization problem to optimize traffic control from a macroscopic view of the road network. To avoid the complex calculations required for non-linear optimization, we proposed an approximation algorithm to calculate equilibrium routing and traffic control strategies. The simulation results show that this algorithm eventually converges to a steady state. The traffic control scheme in this steady state is an approximately optimal solution
Joint Estimation of OD Demands and Cost Functions in Transportation Networks from Data
Existing work has tackled the problem of estimating Origin-Destination (OD)
demands and recovering travel latency functions in transportation networks
under the Wardropian assumption. The ultimate objective is to derive an
accurate predictive model of the network to enable optimization and control.
However, these two problems are typically treated separately and estimation is
based on parametric models. In this paper, we propose a method to jointly
recover nonparametric travel latency cost functions and estimate OD demands
using traffic flow data. We formulate the problem as a bilevel optimization
problem and develop an iterative first-order optimization algorithm to solve
it. A numerical example using the Braess Network is presented to demonstrate
the effectiveness of our method.Comment: To appear at the Proceedings of the 58th IEEE Conference on Decision
and Contro
- …