The cooperative sorting strategy for connected and automated vehicle platoons
Journal article, 2021

This paper presents a "cooperative vehicle sorting" strategy that seeks to optimally sort connected and automated vehicles (CAVs) in a multi-lane platoon to reach an ideally organized platoon. In the proposed method, a CAV platoon is firstly discretized into a grid system, where a CAV moves from one cell to another in discrete time-space domain. Then, the cooperative sorting problem is modeled as a path-finding problem in the graphic domain. The problem is solved by the deterministic A* algorithm with a stepwise strategy, where only one vehicle can move within a movement step. The resultant shortest path is further optimized with an integer linear programming algorithm to minimize the sorting time by allowing multiple movements within a step. To improve the algorithm running time and address multiple shortest paths, a distributed stochastic A* algorithm (DSA*) is developed by introducing random disturbances to the edge costs to break uniform paths (with equal path cost). Numerical experiments are conducted to demonstrate the effectiveness of the proposed DSA* method. The results report shorter sorting time and significantly improved algorithm running time due to the use of DSA*. In addition, we find that the optimization performance can be further improved by increasing the number of processes in the distributed computing system.

Vehicle sorting

Connected and automated vehicles

A* algorithm

Author

Jiaming Wu

Chalmers, Architecture and Civil Engineering, GeoEngineering

Soyoung Ahn

University of Wisconsin Madison

Yang Zhou

University of Wisconsin Madison

Pan Liu

Southeast University

Xiaobo Qu

Chalmers, Architecture and Civil Engineering, GeoEngineering

Transportation Research, Part C: Emerging Technologies

0968-090X (ISSN)

Vol. 123 102986

Subject Categories

Computational Mathematics

Control Engineering

Computer Science

DOI

10.1016/j.trc.2021.102986

More information

Latest update

5/6/2021 2