An Optimization-Based Dynamic Reordering Heuristic for Coordination of Vehicles in Mixed Traffic Intersections
Saved in:
| Title: | An Optimization-Based Dynamic Reordering Heuristic for Coordination of Vehicles in Mixed Traffic Intersections |
|---|---|
| Authors: | Faris, Muhammad, 1991, Zanon, Mario, 1985, Falcone, Paolo, 1977 |
| Source: | IEEE Transactions on Control Systems Technology. 33(4):1387-1402 |
| Subject Terms: | mixed traffic, Autonomous vehicles (AVs), heuristic, vehicle coordination |
| Description: | 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. |
| File Description: | electronic |
| Access URL: | https://research.chalmers.se/publication/544466 https://research.chalmers.se/publication/544466/file/544466_Fulltext.pdf |
| Database: | SwePub |
Full Text Finder 
Nájsť tento článok vo Web of Science | 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. |
|---|---|
| ISSN: | 10636536 15580865 |
| DOI: | 10.1109/TCST.2024.3508542 |