While the traditional approach to ease traffic congestion has focused on building infrastructure, the recent emergence of Connected and Automated Vehicles (CAVs) and urban mobility services (e.g., Autonomous Mobility-on-Demand (AMoD) systems) has opened a new set of alternatives for reducing travel times. This thesis seeks to exploit these advances to improve the operation and efficiency of Intelligent Transportation Systems using a network optimization perspective. It proposes novel methods to evaluate the prospective benefits of adopting socially optimal routing schemes, intermodal mobility, and contraflow lane reversals in transportation networks. This dissertation makes methodological and empirical contributions to the transportation domain. From a methodological standpoint, it devises a fast solver for the Traffic Assignment Problem with Side Constraints which supports arbitrary linear constraints on the flows. Instead of using standard column-generation methods, it introduces affine approximations of the travel latency function to reformulate the problem as a quadratic (or linear) programming problem. This framework is applied to two problems related to urban planning and mobility policy: social routing with rebalancing in intermodal mobility systems and planning lane reversals in transportation networks. Moreover, it proposes a novel method to jointly estimate the Origin-Destination demand and travel latency functions of the Traffic Assignment Problem. Finally, it develops a model to jointly optimize the pricing, rebalancing and fleet sizing decisions of a Mobility-on-Demand service. Empirically, it validates all the methods by testing them with real transportation topologies and real traffic data from Eastern Massachusetts and New York City showing the achievable benefits obtained when compared to benchmarks.

Intelligent Transportation Systems (ITS) can substantially improve roadsafety and trac eciency. This is possible by allowing communicationamong nearby vehicles and among vehicles and xed roadside units. A popularstandard for vehicular communications is IEEE 802.11p. It is basedon a CSMA/CA MAC method that does not guarantee channel access in anite time and so is not suitable for real-time communications. It also needsmethods to control and limit the load, since the transmission of periodicinformation among vehicles can saturate the channel. In this thesis, a newreal-time scheduling algorithm suitable for ITS applications is introduced. Itis based on a TDMA MAC method, where the roadside unit has the tasks toestimate the channel conditions and assign fractions of time slot to users. Alinear programming approach is considered to minimize an index of utility ofthe transmissions. Multi-hop communication scenarios among the vehiclesare considered for both uplink and downlink communications. It is shownhow the optimal duration of the fraction of time slot depends on the channelconditions. A higher channel gain corresponds to a higher transmission timewhereas a lower channel gain corresponds to a lower transmission time. Itis concluded that the approach studied in the thesis can guarantee a highutility provided that the complexity of the optimization is reduced as thenumber of involved vehicles increases.

This thesis presents the use of microscopic traffic simulation models to evaluate the effects of operational-level transportation projects such as ITS. A detailed framework outlining the construction and calibration of microscopic simulation models is provided, as well as the considerations that must be made when analyzing the outputs from these models. Two case studies are used to reinforce the concepts presented. In addition, these case studies give valuable insight for using the outlined approach under real-world conditions. The study indicates a promising future for the use of microsimulation models for the purpose of evaluating operational-level projects, as the theoretical framework of the models is sound, and the computational strategies used are feasible. There are, however, instances where simulation models do not presently model certain phenomena, or where simulation models are too computationally intensive. Comprehensive models that integrate microscopic simulation with land use planning and realistic predictions of human behavior, for instance, cannot practically be modeled in contemporary simulation packages. Other than these instances, the largest obstacles to using simulation packages were found to be the manpower required and the complexity of constructing a model. Continuing research efforts and increasing computer speeds are expected to resolve the former issues. Both of the latter concerns are alleviated by the approach presented herein. Within the approach framework detailed in this thesis, particular emphasis is given to the calibration aspects of constructing a microscopic simulation model. Like the simulation process as a whole, calibration is both an art and a science, and relies on sound engineering judgement rather than indiscriminate, formulaic processes. / Master of Science

Optimal control of autonomous systems is a fundamental and challenging problem, especially when many stringent safety constraints and tight control limitations are involved such that solutions are hard to determine. It has been shown that optimizing quadratic costs while stabilizing affine control systems to desired (sets of) states subject to state and control constraints can be reduced to a sequence of Quadratic Programs (QPs) by using Control Barrier Functions (CBFs) and Control Lyapunov Functions (CLFs). Although computationally efficient, this method is limited by several factors which are addressed in this dissertation. The first contribution of this dissertation is to extend CBFs to high order CBFs (HOCBFs) that can accommodate arbitrary relative degree systems and constraints. The satisfaction of Lyapunov-like conditions in the HOCBF method implies the forward invariance of the intersection of a sequence of sets, which can then guarantee the satisfaction of the original safety constraint. Second, under tight control bounds, this dissertation proposes an analytical method to find sufficient conditions that guarantee the QP feasibility. The sufficient conditions are captured by a single state constraint that is enforced by a CBF and then added to the QP. Third, for complex safety constraints and systems in which it is hard to find sufficient conditions for feasibility, machine learning techniques are employed to learn the definitions of HOCBFs or feasibility constraints. Fourth, when time-varying control bounds and noisy dynamics are involved, adaptive CBFs (AdaCBFs) are proposed, which can guarantee the feasibility of the QPs if the original optimization problem itself is feasible. Finally, for systems with unknown dynamics, adaptive affine control dynamics are proposed to approximate the real unmodelled system dynamics which are updated based on the error states obtained by real-time sensor measurements. A set of events required to trigger a solution of the QP in order to guarantee safety is defined, and a condition that guarantees the satisfaction of the HOCBF constraint between events is derived. In order to address the myopic nature of the CBF method, a real-time control framework that combines optimal trajectories and the computationally efficient HOCBF method providing safety guarantees is also proposed. The HOCBFs and CLFs are used to account for constraints with arbitrary relative degrees and to track the optimal state, respectively. Eventually, an optimal control problem based on the proposed framework is always reduced to a sequence of QPs regardless of the formulation of the original cost function. Another contribution of the dissertation is to apply the above proposed methods to solve complex safety-critical optimal control problems, such as those arising in rule-based autonomous driving and optimal traffic merging control for Connected and Automated Vehicles (CAVs).

In this dissertation, we present generalized techniques which allow for the tracking and classification of vehicles by tracking various Point(s) of Interest (PoI) on a vehicle. Tracking the various PoI allows for the composition of those points into 3D geometries which are unique to a given vehicle type. We demonstrate this technique using passive, simulated image based sensor measurements and three separate inertial track formulations. We demonstrate the capability to classify the 3D geometries in multiple transform domains (PCA & LDA) using Minimum Euclidean Distance, Maximum Likelihood and Artificial Neural Networks. Additionally, we demonstrate the ability to fuse separate classifiers from multiple domains via Bayesian Networks to achieve ensemble classification.

Downstream vehicles detect an emergency response vehicle (ERV) through sirens and/or strobe lights. These traditional warning systems do not give any recommendation about how to react, leaving the drivers confused and often adopting unsafe behavior while trying to open a passage for the ERV. In this research, an advanced intra-link emergency assistance system, that leverages the emerging technologies of the connected vehicle environment, is proposed. The proposed system assumes the presence of a centralized system that gathers/disseminates information from/to connected vehicles via vehicle-to-infrastructure (V2I) communications. The major contribution of this dissertation is the intra-link level support provided to ERV as well as non-ERVs. The proposed system provides network-wide assistance as it also considers the routing of ERVs. The core of the system is a mathematical program - a set of equations and inequalities - that generates, based on location and speed data from connected vehicles that are downstream of the ERV, the fastest intra-link ERV movement. It specifies for each connected non-ERV a final assigned position that the vehicle can reach comfortably along the link. The system accommodates partial market penetration levels and is applicable on large transportation link segments with signalized intersections. The system consists of three modules (1) an ERV route generation module, (2) a criticality analysis module and (2) the sequential optimization module. The first module determines the ERV's route (set of links) from the ERV's origin to the desired destination in the network. Based on this selected route, the criticality analysis module scans/filters the connected vehicles of interest and determines whether any of them should be provided with a warning/instruction message. As the ERV is moving towards its destination, new non-ERVs should be notified. When a group of non-ERVs is identified by the criticality analysis module, a sequential optimization module is activated. The proposed system is evaluated using simulation under different combinations of market penetration and congestion levels. Benefits in terms of ERV travel time with an average reduction of 9.09% and in terms of vehicular interactions with an average reduction of 35.46% and 81.38% for ERV/non-ERV and non-ERV/non-ERV interactions respectively are observed at 100% market penetration, when compared to the current practice where vehicles moving to the nearest edge. / Doctor of Philosophy / Downstream vehicles detect an emergency response vehicle (ERV) through sirens and/or strobe lights. These traditional warning systems do not give any recommendations about how to react, leaving the drivers confused and often adopting unsafe behavior while trying to open a passage for the ERV. In this research, an advanced intra-link emergency assistance system, that leverages the emerging technologies of the connected vehicle environment, is proposed. The proposed system assumes the presence of a centralized system that gathers/disseminates information from/to connected vehicles via vehicle-to-infrastructure (V2I) communications. The major contribution of this dissertation is the intra-link level support provided to ERV as well as non-ERVs. The proposed system provides network-wide assistance as it also considers the routing of ERVs. The core of the system is a mathematical program - a set of equations and inequalities - that generates, based on location and speed data from connected vehicles that are downstream of the ERV, the fastest intra-link ERV movement. It specifies for each connected non-ERV a final assigned position that the vehicle can reach comfortably along the link. The system accommodates partial market penetration levels and is applicable on large transportation link segments with signalized intersections. The system consists of three modules (1) an ERV route generation module, (2) a criticality analysis module and (2) the sequential optimization module. The first module determines the ERV’s route (set of links) from the ERV’s origin to the desired destination in the network. Based on this selected route, the criticality analysis module scans/filters the connected vehicles of interest and determines whether any of them should be provided with a warning/instruction message. As the ERV is moving towards its destination, new non-ERVs should be notified. When a group of non-ERVs is identified by the criticality analysis module, a sequential optimization module is activated. The proposed system is evaluated using simulation under different combinations of market penetration and congestion levels. Benefits in terms of ERV travel time with an average reduction of 9.09% and in terms of vehicular interactions with an average reduction of 35.46% and 81.38% for ERV/non-ERV and non-ERV/non-ERV interactions respectively are observed at 100% market penetration, when compared to the current practice where vehicles moving to the nearest edge.

Traffic congestion has been cited as the most conspicuous problem in traffic management. It has far-reaching economic,social and political effects. Intelligent Transportation Systems (ITS) research and development programs have been assigned the task of developing sophisticated techniques and counter-measures to reduce traffic congestion to manageable levels, and also achieve these objectives using area-wide traffic management methods. During times of traffic congestion, the traffic network in a transient, time-dynamic state, and resembles a dynamic network. In addition, in the context of ITS, the network can accurately detect such transient behavior using traffic sensors, and several other information gathering devices. In conjunction with Operations Research techniques, the time-varying traffic flows can be routed through the network in an optimal manner, based on the feedback from these information sources. Dynamic Traffic Assignment (DTA) methods have been proposed to perform this task. An important step in DTA is the calculation of user-optimal, system-optimal, and multiple optimal routes for assigning traffic. One would also require the calculation of user-optimal paths for vehicle scheduling and dispatching problems. The main objective of this research study is to analyze the effectiveness of time-dependent shortest path (TDSP) algorithms and k-shortest path (k-SP) algorithms as a practical routing tool in such intelligent transportation networks. Similar algorithms have been used to solve routing problems in computer networks. The similarities and differences between computer and ITS road networks are studied. An exhaustive review of TDSP and k-SP algorithms was conducted to classify and determine the best algorithms and implementation procedures available in the literature. A new (heuristic) algorithm (TD-kSP) that calculates multiple optimal paths for dynamic networks is proposed and developed. A complete object-oriented computer program in C++ was written using specialized network representations, node-renumbering schemes and efficient path processing data structures (classes) to implement this algorithm. A software environment where such optimization algorithms can be applied in practice was then developed using object-oriented design methodology. Extensive statistical and regression analysis tests for various random network sizes, densities and other parameters were conducted to determine the computational efficiency of the algorithm. Finally, the algorithm was incorporated within the GIS-based Wide-Area Incident Management Software System (WAIMSS) developed at the Center for Transportation Research, Virginia Tech. The results of these tests are used to obtain the empirical time-complexity of the algorithm. Results indicate that the performance of this algorithm is comparable to the best TDSP algorithms available in the literature, and strongly encourages its possible application in real-time applications. Complete testing of the algorithm requires the use of real-time link flow data. While the use of randomly generated data and delay functions in this study may not significantly affect its computational performance, other measures of effectiveness as a routing tool remains untested. This can be verified only if the algorithm itself becomes a part of the user-behavior feedback loop. A closed loop traffic simulation/ system-dynamics study would be required to perform this task. On the other hand, an open-loop simulation would suffice for vehicle scheduling/dispatching problems. / Master of Science

Traffic congestion is a central problem in transportation systems, especially in urban areas. The rapid development of Connected and Automated Vehicles (CAVs) and new traffic infrastructure technologies provides a promising solution to solve this problem. This work focuses on the safety-critical optimal control of CAVs in autonomous traffic systems. The dissertation starts with the roundabout problem of controlling CAVs travelling through a roundabout so as to jointly minimize their travel time, energy consumption, and centrifugal discomfort while providing speed-dependent safety guarantees. A systematic approach is developed to determine the safety constraints for each CAV dynamically. The joint optimal control and control barrier function (OCBF) controller is applied, where the unconstrained optimal control solution is derived which is subsequently optimally tracked by a real-time controller while guaranteeing the satisfaction of all safety constraints. Secondly, the dissertation deals with the feasibility problem of OCBF. The feasibility problem arises when the control bounds conflict with the Control Barrier Function (CBF) constraints and is solved by adding a single feasibility constraint to the Quadratic Problem (QP) in the OCBF controller to derive the feasibility guaranteed OCBF. The feasibility guaranteed OCBF is applied in the merging control problem which provably guarantees the feasibility of all QPs derived from the OCBF controller. Thirdly, the dissertation deals with the performance loss of OCBF due to the improperly selected reference trajectory which deviates largely from the complete optimal solution especially when the vehicle limitations are tight. A neural network is used to learn the control policy from data retrieved by offline calculation from the complete optimal solutions. Tracking the learnt reference trajectory with CBF outperforms OCBF in simulation experiments. Finally, a hierarchical framework of modular control zones (CZ) is proposed to extend the safety-critical optimal control of CAV from a single CZ to a traffic network. The hierarchical modular CZ framework is developed consisting of a lower-level OCBF controller and a higher-level feedback flow controller to coordinate adjacent CZs which outperforms a direct extension of the OCBF framework to multiple CZs without any flow control in simulation.

No description available.

No description available.