arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 1701.03580math.OCcs.SYeess.SY
收藏

车辆字符串的分布式控制:在有限时间和安全规范下

Distributed control of vehicle strings under finite-time and safety specifications

Indian Institute of Science(印度科学学院);University of California, San Diego(加利福尼亚大学圣地亚哥分校)

Pavankumar Tallapragada, Jorge Cortes

AI总结:

本文研究了具有安全要求和有限时间规范的车辆串最优控制问题,提出了一种可证明正确的分布式控制算法,确保车辆在速度限制、加速度饱和和安全要求下满足有限时间规范,即使在通信故障时也能避免碰撞。

摘要:

本文研究了一类车辆串在有限时间和安全规范下的最优控制问题。我们的研究动机源于自动驾驶车辆在智能交通交叉口循环行驶的场景。我们提出了一种可证明正确的分布式控制算法,确保车辆在速度限制、加速度饱和和安全要求下满足有限时间规范。安全规范保证即使在通信故障时也能避免碰撞。我们还讨论了所提出的分布式算法如何与智能交叉口管理者集成,以提供车辆串可行接近时间的信息以及其在交叉口占用时间的保证界。我们的仿真研究展示了该算法及其关于接近时间、占用时间和燃油和时间成本的特性。

英文摘要:

This paper studies an optimal control problem for a string of vehicles with safety requirements and finite-time specifications on the approach time to a target region. Our problem formulation is motivated by scenarios involving autonomous vehicles circulating on arterial roads with intelligent management at traffic intersections. We propose a provably correct distributed control algorithm that ensures that the vehicles satisfy the finite-time specifications under speed limits, acceleration saturation, and safety requirements. The safety specifications are such that collisions can be avoided even in cases of communication failure. We also discuss how the proposed distributed algorithm can be integrated with an intelligent intersection manager to provide information about the feasible approach times of the vehicle string and a guaranteed bound of its time of occupancy of the intersection. Our simulation study illustrates the algorithm and its properties regarding approach time, occupancy time, and fuel and time cost.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑