论文标题
自动驾驶中约束迭代LQR的乘数交替方向方法
Alternating Direction Method of Multipliers for Constrained Iterative LQR in Autonomous Driving
论文作者
论文摘要
在自主驾驶的背景下,已知迭代线性二次调节器(ILQR)是一种有效的方法来处理运动计划问题中的非线性车辆模型。特别是,受约束的ILQR算法在不同类型的一般约束下实现运动计划任务时表明了计算效率的值得注意的优势结果。但是,受约束的ILQR方法需要在使用对数屏障函数时在第一次迭代时进行可行的轨迹作为先决条件。同样,该方法为纳入快速,高效和有效的优化方法开辟了可能性,以进一步加快优化过程,从而可以成功地满足实时实施的要求。在本文中,定义明确的运动计划问题是在非线性车辆动力学和各种约束下提出的,并利用了乘数的交替方向方法来确定利用ILQR的最佳控制动作。该方法能够在第一次迭代时规避轨迹的可行性要求。然后研究了自动驾驶汽车运动计划的说明性示例。拟议的开发实现了高度计算效率的值得注意的成就。与基于对数屏障函数的约束ILQR算法进行比较,我们提出的方法在三种驾驶场景中,平均计算时间降低了31.93%,38.52%和44.57%;与优化求解器IPOPT相比,我们提出的方法将平均计算时间降低了46.02%,53.26%和88.43%,在三种驾驶场景中。结果,可以通过我们提出的框架实现实时计算和实施,因此它为公路驾驶任务提供了额外的安全性。
In the context of autonomous driving, the iterative linear quadratic regulator (iLQR) is known to be an efficient approach to deal with the nonlinear vehicle model in motion planning problems. Particularly, the constrained iLQR algorithm has shown noteworthy advantageous outcomes of computation efficiency in achieving motion planning tasks under general constraints of different types. However, the constrained iLQR methodology requires a feasible trajectory at the first iteration as a prerequisite when the logarithmic barrier function is used. Also, the methodology leaves open the possibility for incorporation of fast, efficient, and effective optimization methods to further speed up the optimization process such that the requirements of real-time implementation can be successfully fulfilled. In this paper, a well-defined motion planning problem is formulated under nonlinear vehicle dynamics and various constraints, and an alternating direction method of multipliers (ADMM) is utilized to determine the optimal control actions leveraging the iLQR. The approach is able to circumvent the feasibility requirement of the trajectory at the first iteration. An illustrative example of motion planning for autonomous vehicles is then investigated. A noteworthy achievement of high computation efficiency is attained with the proposed development; comparing with the constrained iLQR algorithm based on the logarithmic barrier function, our proposed method reduces the average computation time by 31.93%, 38.52%, and 44.57% in the three driving scenarios; compared with the optimization solver IPOPT, our proposed method reduces the average computation time by 46.02%, 53.26%, and 88.43% in the three driving scenarios. As a result, real-time computation and implementation can be realized through our proposed framework, and thus it provides additional safety to the on-road driving tasks.