The development of connected autonomous vehicles (CAVs) facilitates the enhancement of traffic efficiency in complicated scenarios. In unsignalized roundabout scenarios, difficulties remain unsolved in developing an effective and efficient coordination strategy for CAVs. In this paper, we formulate the cooperative autonomous driving problem of CAVs in the roundabout scenario as a constrained optimal control problem, and propose a computationally-efficient parallel optimization framework to generate strategies for CAVs such that the travel efficiency is improved with hard safety guarantees. All constraints involved in the roundabout scenario are addressed appropriately with convex approximation, such that the convexity property of the reformulated optimization problem is exhibited. Then, a parallel optimization algorithm is presented to solve the reformulated optimization problem, where an embodied iterative nearest neighbor search strategy to determine the optimal passing sequence in the roundabout scenario. It is noteworthy that the travel efficiency in the roundabout scenario is enhanced and the computation burden is considerably alleviated with the innovation development. We also examine the proposed method in CARLA simulator and perform thorough comparisons with a rule-based baseline and the commonly used IPOPT optimization solver to demonstrate the effectiveness and efficiency of the proposed approach.

翻译：网联自动驾驶车辆的发展促进了复杂场景下交通效率的提升。在无信号环形交叉口场景中，如何制定高效且有效的协同策略仍存在难题。本文将环形交叉口场景中的网联自动驾驶车辆协作自动驾驶问题建模为约束最优控制问题，并提出一种计算高效的并行优化框架，以生成具有硬安全保证的车辆通行策略，从而提升通行效率。通过凸近似方法合理处理环形交叉口场景中的所有约束条件，使得重构后的优化问题具有凸性特征。随后提出一种并行优化算法求解该重构问题，其中嵌入迭代最近邻搜索策略以确定环形交叉口场景中的最优通行序列。值得注意的是，通过创新方法不仅提升了环形交叉口的通行效率，还显著降低了计算负担。我们在CARLA仿真器中验证所提方法，并与基于规则的基线方法及常用的IPOPT优化求解器进行全方位对比，以证明所提方法的有效性与高效性。