التفاصيل البيبلوغرافية
| العنوان: |
车路协同下的无信号交叉口车辆通行调度策略. (Chinese) |
| Alternate Title: |
Vehicle traffic scheduling strategy at unsignalized intersections under vehicle road coordination. (English) |
| المؤلفون: |
张方忆, 彭景阳, 李磊, 王文格 |
| المصدر: |
Application Research of Computers / Jisuanji Yingyong Yanjiu; Jul2024, Vol. 41 Issue 7, p2088-2092, 5p |
| Abstract (English): |
The vehicle traffic scheduling problem at unsignalized intersections is the research focus in the field of intelligent transportation. Because the solution space of vehicle traffic order decision problem increases exponentially with the increase of the number of vehicles, finding the optimal traffic sequence while ensuring the real-time performance has become a major problem for traffic scheduling at unsignalized intersections. To solve this problem, this paper proposed a vehicle traffic scheduling method at unsignalized intersections based on adaptive Monte Carlo tree search algorithm, which used a hierarchical framework, upper level centralized sequential decision-making, and lower level distributed trajectory planning. Firstly, the intersection model based on the conflict point was established, the connected vehicles were added to the queue to be searched, the Monte Carlo tree search process of the traffic sequence was designed according to the vehicle traffic characteristics in the intersection, the evaluation function was established with the total traffic time as the index, and then the adaptive exploration coefficient and other super parameters were designed for different traffic situations, so that the algorithm could maintain the best state in solving different vehicle numbers and different search periods. In the trajectory planning process, the acceleration two norm was taken as the objective function, and the speed, acceleration and the position of the starting point were taken as constraints to establish the optimal control proposition to solve the vehicle trajectory. Finally, experiments were carried out, and the results show that compared with other algorithms, the maximum optimization amplitude of this algorithm in numerical simulation and micro platform experiment is 33.42% and 38.04% respectively, which provides an effective solution for vehicle traffic scheduling at unsignalized intersections. [ABSTRACT FROM AUTHOR] |
| Abstract (Chinese): |
无信号交叉口车辆通行调度问题是智能交通领域的研究重点,由于车辆通行顺序决策问题的解空间随 着车辆数增加而指数级增长,在保证实时性的同时找到较优通行顺序成为无信号交叉口通行调度的-大问题. 针对该问题提出-种基于自适应蒙特卡罗树搜索算法的无信号交叉口车辆通行调度方法,采用分层式框架,上 层集中式顺序决策,下层分布式轨迹规划. 首先,建立基于冲突点的交叉口模型,将网联车加入到待搜索队列 中,根据交叉口中的车辆通行特点设计通行顺序的蒙特卡罗树搜索流程,以总通行时间为指标建立评价函数,然 后针对不同交通情景设计自适应探索系数及其他超参数,使算法在求解不同车辆数时以及搜索的不同时期保持 最佳状态. 轨迹规划环节以加速度二范数为目标函数,以速度、加速度以及始终点位置等为约束,建立最优控制 命题求解车辆轨迹. 最后,进行实验,结果表明该算法相较于其他算法在数值仿真和微缩平台实验中最大优化 幅度分别达到33.42%和38.04%,为无信号交叉口车辆通行调度提供了-个有效解决方案. [ABSTRACT FROM AUTHOR] |
|
Copyright of Application Research of Computers / Jisuanji Yingyong Yanjiu is the property of Application Research of Computers Edition and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| قاعدة البيانات: |
Complementary Index |
