An Optimal Vehicle-Scheduling Model for Signal-Free Intersections Considering Bus Priority in a Connected and Automated Vehicle Environment

考虑公交优先的联网自动驾驶车辆环境下无信号交叉口最优车辆调度模型

阅读:1

Abstract

The optimal scheduling of vehicles at signal-free intersections under the connected and automated vehicle (CAV) environment has become a research hotspot in the intelligent transportation field. However, existing studies often oversimplify the intersection's conflict area and fail to adequately address the spatiotemporal sparsity of conflict points, with little attention given to bus priority requirements. To address these gaps, this paper first establishes an intersection coordinate system and constructs a conflict area analysis model based on the coordinates of key conflict points and vehicle trajectories. Subsequently, an optimal scheduling model for automated vehicles at signal-free intersections with bus priority is developed, which considers the set of vehicles influencing decisions within a time window and uses vehicle entry times and lateral lane changes as decision variables. To enhance computational speed while preserving convergence accuracy, a search space reduction method based on available gaps for conflict point traversal constraints is designed. The model is then solved using an improved double-layer multi-population particle swarm optimization (PSO) algorithm. Simulation results, compared against traditional signal control, rule-driven signal-free, and dynamic-optimization-based signal-free algorithms demonstrate that the proposed method achieves a favorable balance between computational cost and efficiency. It significantly reduces the average vehicle delay. Moreover, incorporating bus priority reduces the average per capita delay by 18.95% compared to the non-priority scenario, effectively proving the validity of the proposed method.

特别声明

1、本页面内容包含部分的内容是基于公开信息的合理引用;引用内容仅为补充信息,不代表本站立场。

2、若认为本页面引用内容涉及侵权,请及时与本站联系,我们将第一时间处理。

3、其他媒体/个人如需使用本页面原创内容,需注明“来源:[生知库]”并获得授权;使用引用内容的,需自行联系原作者获得许可。

4、投稿及合作请联系:info@biocloudy.com。