交叉口(航空)
计算机科学
弹道
数学优化
蒙特卡罗树搜索
树(集合论)
排队论
碰撞
迭代法
蒙特卡罗方法
算法
数学
工程类
运输工程
计算机网络
数学分析
统计
物理
计算机安全
天文
作者
Xinle Gong,Bowen Wang,Sheng Liang
标识
DOI:10.1109/tsmc.2023.3346275
摘要
This article proposes a novel cooperative motion planning and decision-making approach for connected and automated vehicles (CAVs) at unsignalized intersections, where a multivehicle collision-free trajectories generating problem is modeled as a constrained optimization problem. A learning-based iterative optimization (LBIO) algorithm is developed to solve the problem iteratively and obtain velocity-optimal trajectories using the historical vehicle states at previous iterations as data sets. To make the trained trajectories adapt to continuous and time-varying traffic flow, an online decision-making algorithm based on Monte Carlo tree search (MCTS) is presented to derive a time-optimal vehicle passing sequence, where a tree structure is built to efficiently express all possible cluster-dividing modes between vehicles. In addition, we propose a trajectory planning algorithm to regulate velocities of vehicles in the cooperative control area surrounding the intersection. The proposed approach is validated on the SUMO under typical intersection scenarios. Results show that our approach enables potentially conflicting vehicles to go through the intersection simultaneously without queuing and significantly improves the overall traffic efficiency.
科研通智能强力驱动
Strongly Powered by AbleSci AI