An official website of the United States government
Connected and automated vehicle (CAV) technology is providing urban transportation managers tremendous opportunities for better operation of urban mobility systems. However, there are significant challenges in real-time implementation as the computational time of the corresponding operations optimization model increases exponentially with increasing vehicle numbers. Following the companion paper (Chen et al. 2021), which proposes a novel automated traffic control scheme for isolated intersections, this study proposes a network-level, real-time traffic control framework for CAVs on grid networks. The proposed framework integrates a rhythmic control method with an online routing algorithm to realize collision-free control of all CAVs on a network and achieve superior performance in average vehicle delay, network traffic throughput, and computational scalability. Specifically, we construct a preset network rhythm that all CAVs can follow to move on the network and avoid collisions at all intersections. Based on the network rhythm, we then formulate online routing for the CAVs as a mixed integer linear program, which optimizes the entry times of CAVs at all entrances of the network and their time–space routings in real time. We provide a sufficient condition that the linear programming relaxation of the online routing model yields an optimal integer solution. Extensive numerical tests are conducted to show the performance of the proposed operations management framework under various scenarios. It is illustrated that the framework is capable of achieving negligible delays and increased network throughput. Furthermore, the computational time results are also promising. The CPU time for solving a collision-free control optimization problem with 2,000 vehicles is only 0.3 second on an ordinary personal computer.
more »
« less
Re-Routing Strategy of Connected and Automated Vehicles Considering Coordination at Intersections
In this paper, we propose a re-routing strategy for connected and automated vehicles (CAVs), considering coordination and control of all the CAVs in the network. The objective for each CAV is to find the route that minimizes the total travel time of all CAVs. We coordinate CAVs at signal-free intersections to accurately predict the travel time for the routing problem. While it is possible to find a system-optimal solution by comparing all the possible combinations of the routes, this may impose a computational burden. Thus, we instead find a person-by-person optimal solution to reduce computational time while still deriving a better solution than selfish routing. We validate our framework through simulations in a grid network.
more »
« less
- PAR ID:
- 10421257
- Date Published:
- Journal Name:
- 2023 American Control Conference
- Page Range / eLocation ID:
- 4419-4424
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
As Autonomous Vehicles (AVs) become possible for E-hailing services operate, especially when telecom companies start deploying next-generation wireless networks (known as 5G), many new technologies may be applied in these vehicles. Dynamic-route-switching is one of these technologies, which could help vehicles find the best possible route based on real-time traffic information. However, allowing all AVs to choose their own optimal routes is not the best solution for a complex city network, since each vehicle ignores its negative effect on the road system due to the additional congestion it creates. As a result, with this system, some of the links may become over-congested, causing the whole road network system performance to degrade. Meanwhile, the travel time reliability, especially during the peak hours, is an essential factor to improve the customers' ride experience. Unfortunately, these two issues have received relatively less attention. In this paper, we design a link-based dynamic pricing model to improve the road network system and travel time reliability at the same time. In this approach, we assume that all links are eligible with the dynamic pricing, and AVs will be perfect informed with update traffic condition and follow the dynamic road pricing. A heuristic approach is developed to address this computationally difficult problem. The output includes link-based surcharge, new travel demand and traffic condition which would improve the system performance close to the System Optimal (SO) solution and maintain the travel time reliability. Finally, we evaluate the effectiveness and efficiency of the proposed model to the well-known test Sioux Falls network.more » « less
-
Given a transportation network, a source node s, a destination node t , and the number of maximum possible turnings b , the Turn-Constrained Shortest Path (TCSP) problem is to find the route that minimizes the travel distance and meets the turn-constraint. The TCSP problem is important for societal applications such as shipping and logistics, emergency route planning, and traffic management services. We propose novel approaches for TCSP to meet the turn-constraint while minimizing the travel distance for the vehicle route. Experiments using real-world datasets demonstrated that the proposed algorithms can minimize the travel distance and meet the turn-constraint; furthermore, it has comparable solution quality to the unconstrained shortest path and significantly reduces the computational cost.more » « less
-
Vehicle platooning using connected and automated vehicles (CAVs) has attracted considerable attention. In this paper, we address the problem of optimal coordination of CAV platoons at a highway on-ramp merging scenario. We present a single-level constrained optimal control framework that optimizes the fuel economy and travel time of the platoons while satisfying the state, control, and safety constraints. We also explore the effect of delayed communication among the CAV platoons and propose a robust coordination framework to enforce lateral and rear-end collision avoidance constraints in the presence of bounded delays. We provide a closed-form analytical solution to the optimal control problem with safety guarantees that can be implemented in real time. Finally, we validate the effectiveness of the proposed control framework using a high-fidelity commercial simulation environment.more » « less
-
Driverless or fully automated vehicles (AVs) are expected to fundamentally change how individuals and households travel and how vehicles use roadway infrastructure. The first goal of this study is to develop a modeling framework of activity-constrained household travel in a future multi-modal network with private AVs, shared-use AVs, transit, and intermodal AV-transit travel options. The second goal is to analyze the potential impacts of AVs—including intermodal AV-transit travel—on (a) household-level travel behavior, (b) household travel costs, (c) demand for transport modes, including transit, and (d) vehicle kilometers traveled or VKT. To meet the first goal, we propose and formulate the Household Activity Pattern Problem with AV-enabled Intermodal Trips (HAPP-AV-IT) that incorporates AV deadheading and intermodal AV-transit trips. The modeling framework extends prior HAPP-based formulations that model household-level travel decisions as vehicle (and person) routing and scheduling problems, similar to the pickup and delivery problem with time-windows. To meet the second goal, we apply the HAPP-AV-IT to two case studies and conduct many computational experiments. We use synthetic activity location data for synthetic households and a fictitious medium-size network with a road network, transit network, residential locations, activity locations, and parking locations. The computational results illustrate (a) the critical role that household AV ownership plays in terms of household travel decisions, modal demand, and VKT, (b) that with AVs, deadheading accounts for 30–40 % of vehicle operating distances, (c) that around 10 % of households in the study region benefit from AV-based intermodal trips, and (d) that those 10 % of households see 5 % reductions in household travel costs and 25 % reductions in VKT on average in the most transit friendly scenario. This last finding suggests that intermodal AV-transit trips may exist in a driverless vehicle future, and therefore, transit agencies and transportation planners should consider how to serve this market. We also propose and test a simple heuristic algorithm that quickly solves HAPP-AV-IT problem instances.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Conference Paper:
- The DOI is not currently available.
