The implementation of connected and automated vehicle (CAV) technologies enables a novel computational framework to deliver real-time control actions that optimize travel time, energy, and safety. Hardware is an integral part of any practical implementation of CAVs, and as such, it should be incorporated in any validation method. However, high costs associated with full scale, field testing of CAVs have proven to be a significant barrier. In this paper, we present the implementation of a decentralized control framework, which was developed previously, in a scaled-city using robotic CAVs, and discuss the implications of CAVs on travel time. Supplemental information and videos can be found at this https URL.
Although previous work has shown promising results emphasizing the potential benefits of coordination of CAVs, validation has been primarily in simulation. In previous work, we presented the experimental validation of the solution of the unconstrained merging roadway problem in UDSSC using @math robotic CAVs @cite_18 . In this paper, we demonstrate the impact of an optimal decentralized framework, developed in earlier work @cite_26 , for coordinating CAVs in a transportation network with multiple conflict zones where potential lateral collision may occur.
@cite_18 @cite_26
2904365072 2255404673 2010725166 2896594106
In earlier work, we established a decentralized optimal control framework for coordinating online connected and automated vehicles (CAVs) in specific transportation segments, e.g., urban intersections, merging roadways, roundabouts, and speed reduction zones. In this paper, we address coordination of CAVs in a corridor with multiple such scenarios and derive a closed-form analytical solution that includes interior boundary conditions. We evaluate the effectiveness of the solution through simulation in VISSIM. The proposed approach reduces significantly both fuel consumption and travel time for the CAVs compared to the baseline scenario where traditional human-driven vehicles without control are considered. In earlier work, we addressed the problem of coordinating online an increasing number of connected and automated vehicles (CAVs) crossing two adjacent intersections in an urban area. The analytical solution, however, did not consider the state and control constraints. In this paper, we present the complete Hamiltonian analysis including state and control constraints. In addition, we present conditions that do not allow the rear-end collision avoidance constraint to become active at any time inside the control zone. The complete analytical solution, when it exists, allows the vehicles to cross the intersection without the use of traffic lights and under the hard constraint of collision avoidance. The effectiveness of the proposed solution is validated through simulation in a single intersection and it is shown that coordination of CAVs can reduce significantly both fuel consumption and travel time. In this paper, we leverage vehicle-to-vehicle (V2V) communication technology to implement computationally efficient decentralized algorithms for two-vehicle cooperative collision avoidance at intersections. Our algorithms employ formal control theoretic methods to guarantee a collision-free (safe) system, whereas overrides are only applied when necessary to prevent a crash. Model uncertainty and communication delays are explicitly accounted for by the model and by the state estimation algorithm. The main contribution of this work is to provide an experimental validation of our method on two instrumented vehicles engaged in an intersection collision avoidance scenario in a test track. Conventionally, planning frameworks for autonomous vehicles consider large safety margins and pre- defined paths for performing the merge maneuvers. These considerations often increase the wait time at the intersec- tions leading to traffic disruption. In this paper, we present a motion planning framework for autonomous vehicles to perform merge maneuver in dense traffic. Our framework is divided into a two-layer structure, Lane Selection layer and Scale optimization layer. The Lane Selection layer computes the likelihood of collision along the lanes. This likelihood represents the collision risk associated with each lane and is used for lane selection. Subsequently, the Scale optimization layer solves the time scaled collision cone (TSCC) constraint re- actively for collision-free velocities. Our framework guarantees a collision-free merging even in dense traffic with minimum disruption. Furthermore, we show the simulation results in different merging scenarios to demonstrate the efficacy of our framework.