论文标题
与车辆的无车道交通中的连接和自动化车辆的最佳轨迹计划
Optimal Trajectory Planning for Connected and Automated Vehicles in Lane-free Traffic with Vehicle Nudging
论文作者
论文摘要
该论文通过使用最佳控制方法在无车道交通环境中提出了连接和自动化车辆(CAV)(CAVS)的运动策略。考虑到控制输入的国家依赖性约束,以确保车辆在道路边界内移动并防止碰撞。设计了一个包含各种加权亚物体的目标函数,其最小化最小化会在可能的情况下以所需的速度提高车辆的进步,同时避免遇到障碍。非线性最佳控制问题(OCP)是为了最小化目标函数而受到每辆车的约束的最小化。在事件触发的基础上调用了计算有效的可行方向算法(FDA),以实时计算模型预测性控制(MPC)框架中有限的时间疗法的数值解决方案。该方法适用于道路上的每辆车,同时在无车道环路上进行模拟,以适用于多种车辆密度和不同类型的车辆。从为每辆相关车辆创造无数驾驶发作的模拟中,可以观察到,所提出的方法在提供安全,舒适和高效的车辆轨迹以及高交通流量的情况下高效。该方法正在调查中,以在各种无车道的道路基础设施中进一步用于CAV交通。
The paper presents a movement strategy for Connected and Automated Vehicles (CAVs) in a lane-free traffic environment with vehicle nudging by use of an optimal control approach. State-dependent constraints on control inputs are considered to ensure that the vehicle moves within the road boundaries and to prevent collisions. An objective function, comprising various weighted sub-objectives, is designed, whose minimization leads to vehicle advancement at the desired speed, when possible, while avoiding obstacles. A nonlinear optimal control problem (OCP) is formulated for the minimization of the objective function subject to constraints for each vehicle. A computationally efficient Feasible Direction Algorithm (FDA) is called, on event-triggered basis, to compute in real-time the numerical solution for finite time-horizons within a Model Predictive Control (MPC) framework. The approach is applied to each vehicle on the road, while running simulations on a lane-free ring-road, for a wide range of vehicle densities and different types of vehicles. From the simulations, which create myriads of driving episodes for each involved vehicle, it is observed that the proposed approach is highly efficient in delivering safe, comfortable and efficient vehicle trajectories, as well as high traffic flow outcomes. The approach is under investigation for further use in various lane-free road infrastructures for CAV traffic.