论文标题

在车辆网络中排队的最佳控制

Optimal Control for Platooning in Vehicular Networks

论文作者

Gomides, Thiago S., Kranakis, Evangelos, Lambadaris, Ioannis, Viniotis, Yannis

论文摘要

随着汽车行业正在开发自动驾驶系统和车辆网络,对卡车排的关注已增加,这是降低成本(燃料消耗)并提高高速公路效率的一种方式。该领域的最新研究主要集中于排球,网络稳定性和排脚的纵向控制。但是,系统方面(例如,排协调)仍未得到很好的探索。在本文中,我们制定了一个排队的协调问题,并研究在初始位置等待的卡车是否应该等待排到达才能离开。车站的卡车到达,车站的排是由独立的伯努利分布来建模的。接下来,我们使用马尔可夫决策过程的理论来制定调度控制问题,并得出管理卡车用排的最佳策略。我们表明,将车站的平均成本功能最小化的政策是阈值类型。提出了平均成本案例的数值结果。它们与最佳的一致。

As the automotive industry is developing autonomous driving systems and vehicular networks, attention to truck platooning has increased as a way to reduce costs (fuel consumption) and improve efficiency in the highway. Recent research in this area has focused mainly on the aerodynamics, network stability, and longitudinal control of platoons. However, the system aspects (e.g., platoon coordination) are still not well explored. In this paper, we formulate a platooning coordination problem and study whether trucks waiting at an initial location (station) should wait for a platoon to arrive in order to leave. Arrivals of trucks at the station and platoons by the station are modelled by independent Bernoulli distributions. Next we use the theory of Markov Decision Processes to formulate the dispatching control problem and derive the optimal policy governing the dispatching of trucks with platoons. We show that the policy that minimizes an average cost function at the station is of threshold type. Numerical results for the average cost case are presented. They are consistent with the optimal ones.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源