In this article, we address a coordination problem for connected and autonomous vehicles (CAVs) in mixed traffic settings with human-driven vehicles (HDVs). The main objective is to have a safe and optimal crossing order for vehicles approaching unsignalized intersections. This problem results in a mixed-integer quadratic programming (MIQP) formulation, which is unsuitable for real-time applications. Therefore, we propose a computationally tractable optimization-based heuristic that monitors platoons of CAVs and HDVs to evaluate whether alternative crossing orders can perform better. It first checks the future constraint violation that consistently occurs between pairs of platoons to determine a potential swap. Next, the costs of quadratic programming (QP) formulations associated with the current and alternative orders are compared in a depth-first branching fashion. In simulations, we show that our heuristic can be a hundred times faster than the original and simplified MIQPs (SMIQPs) and yields solutions that are close to optimal and have better order consistency.

An optimization-based dynamic reordering heuristic for coordination of vehicles in mixed traffic intersections

Zanon Mario
;
2025

Abstract

In this article, we address a coordination problem for connected and autonomous vehicles (CAVs) in mixed traffic settings with human-driven vehicles (HDVs). The main objective is to have a safe and optimal crossing order for vehicles approaching unsignalized intersections. This problem results in a mixed-integer quadratic programming (MIQP) formulation, which is unsuitable for real-time applications. Therefore, we propose a computationally tractable optimization-based heuristic that monitors platoons of CAVs and HDVs to evaluate whether alternative crossing orders can perform better. It first checks the future constraint violation that consistently occurs between pairs of platoons to determine a potential swap. Next, the costs of quadratic programming (QP) formulations associated with the current and alternative orders are compared in a depth-first branching fashion. In simulations, we show that our heuristic can be a hundred times faster than the original and simplified MIQPs (SMIQPs) and yields solutions that are close to optimal and have better order consistency.
2025
Autonomous vehicles (AVs)
Heuristic
Mixed traffic
Vehicle coordination
File in questo prodotto:
File Dimensione Formato  
An_Optimization-Based_Dynamic_Reordering_Heuristic_for_Coordination_of_Vehicles_in_Mixed_Traffic_Intersections.pdf

accesso aperto

Descrizione: An Optimization-based Dynamic Reordering Heuristic for Coordination of Vehicles in Mixed Traffic Intersections
Tipologia: Versione Editoriale (PDF)
Licenza: Creative commons
Dimensione 1.64 MB
Formato Adobe PDF
1.64 MB Adobe PDF Visualizza/Apri
PhD_Muhammad___Journal_1.pdf

accesso aperto

Descrizione: Postprint - An Optimization-based Dynamic Reordering Heuristic for Coordination of Vehicles in Mixed Traffic Intersections
Tipologia: Documento in Post-print
Licenza: Creative commons
Dimensione 2.7 MB
Formato Adobe PDF
2.7 MB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.11771/35398
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
social impact