arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2203.04348eess.SYcs.SY
收藏

基于控制障碍函数的可行性保证交通合流控制

Feasibility Guaranteed Traffic Merging Control Using Control Barrier Functions

Kaiyuan Xu, Wei Xiao, Christos G. Cassandras

摘要:

我们考虑互联和自动驾驶车辆(CAV)的合并控制问题,旨在共同最大限度地减少旅行时间和能源消耗,同时提供速度相关的安全保证,并满足速度和加速度约束。应用联合最优控制和控制障碍函数(OCBF)方法,通过将最优跟踪问题转化为一系列二次规划问题,有效地得到了一个在保证满足所有约束条件的前提下最优跟踪无约束最优控制解的控制器.然而,这些QP可能变得不可行,特别是在严格的控制范围内,从而无法保证安全限制。我们解决这个问题,推导出一个控制相关的可行性约束对应于每个CBF的约束,这是添加到每个QP,我们表明,每个这样的修改QP保证是可行的。合并控制问题的大量仿真说明了这种可行性保证控制器的有效性。

英文摘要:

We consider the merging control problem for Connected and Automated Vehicles (CAVs) aiming to jointly minimize travel time and energy consumption while providing speed-dependent safety guarantees and satisfying velocity and acceleration constraints. Applying the joint optimal control and control barrier function (OCBF) method, a controller that optimally tracks the unconstrained optimal control solution while guaranteeing the satisfaction of all constraints is efficiently obtained by transforming the optimal tracking problem into a sequence of quadratic programs (QPs). However, these QPs can become infeasible, especially under tight control bounds, thus failing to guarantee safety constraints. We solve this problem by deriving a control-dependent feasibility constraint corresponding to each CBF constraint which is added to each QP and we show that each such modified QP is guaranteed to be feasible. Extensive simulations of the merging control problem illustrate the effectiveness of this feasibility guaranteed controller.

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

↑