arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2003.13067eess.SYcs.SYmath.OC

优化协同车辆编队:一种基于随机动态规划的分析方法

Optimizing Coordinated Vehicle Platooning: An Analytical Approach Based on Stochastic Dynamic Programming

Xi Xiong, Junyi Sha, Li Jin

AI总结:

本文研究高速公路路口处网联自动驾驶车辆编队协调问题,将其建模为马尔可夫决策过程,证明最优策略为基于到达时间差的阈值策略,并提出高效算法和积分方程求解方法,仿真验证其优于传统方法。

摘要:

对网联自动驾驶车辆(CAVs)进行编队行驶可以改善交通和燃油效率。然而,可扩展的编队运行需要路口级协调,而这一问题尚未得到充分研究。本文研究高速公路路口处的车辆编队协调问题。我们考虑的场景是:网联自动驾驶车辆按照一般更新过程随机到达高速公路路口。当一辆网联自动驾驶车辆接近路口时,系统操作员根据该车辆与编队的位置和速度,决定该车辆是否并入前方编队。我们将该问题建模为一个马尔可夫决策过程,目标是在无限时间范围内最小化折扣累积行驶成本,即燃油消耗加上行驶延误。我们证明最优策略是基于阈值的:当且仅当该网联自动驾驶车辆与编队到达路口的预测时间之差小于一个常数阈值时,该车辆才会并入编队。我们还提出了两种可直接实施的算法来推导最优策略。与经典值迭代算法的比较表明,我们的方法显式地结合了最优策略的特性,在计算效率方面显著更高。重要的是,我们证明在泊松到达条件下,最优策略可以通过求解一个积分方程组来获得。我们还利用真实交通数据,在实时策略(RTS)仿真中验证了我们的结果。仿真结果表明,与传统方法相比,所提出的方法具有更好的性能。

英文摘要:

Platooning connected and autonomous vehicles (CAVs) can improve traffic and fuel efficiency. However, scalable platooning operations require junction-level coordination, which has not been well studied. In this paper, we study the coordination of vehicle platooning at highway junctions. We consider a setting where CAVs randomly arrive at a highway junction according to a general renewal process. When a CAV approaches the junction, a system operator determines whether the CAV will merge into the platoon ahead according to the positions and speeds of the CAV and the platoon. We formulate a Markov decision process to minimize the discounted cumulative travel cost, i.e. fuel consumption plus travel delay, over an infinite time horizon. We show that the optimal policy is threshold-based: the CAV will merge with the platoon if and only if the difference between the CAV's and the platoon's predicted times of arrival at the junction is less than a constant threshold. We also propose two ready-to-implement algorithms to derive the optimal policy. Comparison with the classical value iteration algorithm implies that our approach explicitly incorporating the characteristics of the optimal policy is significantly more efficient in terms of computation. Importantly, we show that the optimal policy under Poisson arrivals can be obtained by solving a system of integral equations. We also validate our results in simulation with Real-time Strategy (RTS) using real traffic data. The simulation results indicate that the proposed method yields better performance compared with the conventional method.

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

↑