arXivDaily arXiv每日学术速递 周一至周五更新
稍安勿躁,官方尚未更新
arXiv 2003.06481eess.SYcs.SY
收藏

The Cooperative Sorting Strategy for Connected and Automated Vehicle Platoons

Jiaming Wu, Soyoung Ah, Yang Zhou, Pan Liu, Xiaobo Qu

英文摘要:

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 the 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 Astar 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 Astar 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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑