- The paper introduces a graph-based method that formalizes conflict-free scheduling at unsignalized intersections for connected and automated vehicles.
- It details two algorithms, iDFST and MCC, which optimize vehicle order and reduce evacuation times while maintaining computational efficiency.
- Simulations validate that the MCC approach achieves near-global optimal performance under heavy traffic conditions.
Conflict-free Cooperation Method for Connected and Automated Vehicles at Unsignalized Intersections: Graph-based Modeling and Optimality Analysis
Introduction
The paper "Conflict-free Cooperation Method for Connected and Automated Vehicles at Unsignalized Intersections: Graph-based Modeling and Optimality Analysis" (2107.07179) explores the intricate challenges of improving traffic flow and safety at unsignalized intersections utilizing connected and automated vehicles (CAVs). The research focuses on a novel graph-based approach to schedule vehicle movements effectively, ensuring collision-free passage while optimizing traffic throughput.
Graph-Based Modeling Approach
The authors introduce a method to formalize the conflict-free scheduling problem by leveraging graph theory. Key components include:
- Conflict Directed Graph (CDG): This graph represents the conflict relationships between vehicle trajectories using directed edges. Unidirectional edges denote restrictions such as diverging and reachability conflicts, while bidirectional edges represent crossing and converging conflicts.
- Coexisting Undirected Graph (CUG): The complement of the CDG, the CUG is used to identify groups of vehicles that can simultaneously traverse the intersection without conflicts.
Two principal algorithms are detailed for determining vehicle passing order:
- Improved Depth-First Spanning Tree (iDFST) Method: Enhances previous methods by categorizing conflict types and optimizing vehicle order using spanning tree principles, achieving local optimal solutions with reduced computational complexity.
- Minimum Clique Cover (MCC) Method: This novel approach reduces the scheduling problem to finding the minimal number of cliques in the CUG, targeting globally optimal passing orders. A heuristic method addresses the computational infeasibility of exact solutions for large vehicle sets.
Distributed Control Framework
To implement the scheduled traversal plans, a hierarchical control framework is proposed:
- Central Coordinator: Collects real-time vehicle data and schedules passing orders.
- Distributed Vehicle Controllers: Execute the designated arrival plans, supported by a communication topology based on predecessor-leader following (PLF), which minimizes bandwidth requirements.
Simulation and Results
Extensive simulations demonstrate the efficacy of the proposed algorithms:
- Both iDFST and MCC methods substantially reduce evacuation times compared to baseline DFST methods, illustrating significant improvements in traffic efficiency.
- The MCC method, through heuristic solutions, approaches global optimal performance more closely than iDFST, particularly under heavier traffic conditions.
- Computational efficiency is maintained with linear complexity, making these methods viable for real-time applications in dynamic urban traffic environments.
Conclusion
The research offers compelling evidence that graph-based modeling, coupled with advanced scheduling algorithms, can significantly enhance traffic management at unsignalized intersections. While iDFST provides a robust locally optimal solution, the MCC approach further extends the capabilities towards a global optimum. Future work could explore integrating lane-changing behaviors and extending the control framework to networks of intersections, advancing towards comprehensive urban traffic management systems.