Time-Optimal Coordination for Connected and Automated Vehicles at Adjacent Intersections

In this paper, the authors provide a hierarchical coordination framework for connected and automated vehicles (CAVs) at two adjacent intersections. This framework consists of an upper-level scheduling problem and a low-level optimal control problem. By partitioning the area around two adjacent intersections into different zones, the authors formulate a scheduling problem for each individual CAV aimed at minimizing its total travel time. For each CAV, the solution of the upper-level problem designates the arrival times at each zones on its path which becomes the inputs of the low-level problem. The solution of the low-level problem yields the optimal control input (acceleration/deceleration) of each CAV to exit the intersections at the time specified in the upper-level scheduling problem. The authors validate the performance of their proposed hierarchical framework through extensive numerical simulations and comparison with signalized intersections, centralized scheduling, and FIFO queuing policy.

Language

  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 01881480
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Apr 27 2023 5:13PM