arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1701.00558math.OC
收藏

带状态约束的非凸最优控制问题的逐次凸化

Successive Convexification of Non-Convex Optimal Control Problems with State Constraints

Yuanqi Mao, Daniel Dueri, Michael Szmuk, Behçet Açıkmeşe

摘要:

本文提出了一种求解一类具有特定状态约束的非凸最优控制问题的逐次凸化($ \texttt{SCvx} $)算法。非凸性的来源可以包括非线性动力学和非凸状态/控制约束。为了解决非凸性带来的挑战,我们首先利用精确罚函数来处理非线性动力学。然后,所提出的算法通过$ \textit{project-and-linearize} $过程连续地将问题转化。因此,有限维凸规划子问题的解决,在每一个连续的,这可以有效地完成快速内点方法(IPM)求解器。证明了整体收敛到局部最优值的某些凸性假设,这是满足广泛的最优控制问题。该算法特别适用于求解带避碰约束的轨迹规划问题。通过数值模拟,我们证明了该算法收敛可靠后,只有几个连续。因此,与强大的IPM为基础的自定义求解器,该算法可以实现板载实时自主控制应用。

英文摘要:

This paper presents a Successive Convexification ($ \texttt{SCvx} $) algorithm to solve a class of non-convex optimal control problems with certain types of state constraints. Sources of non-convexity may include nonlinear dynamics and non-convex state/control constraints. To tackle the challenge posed by non-convexity, first we utilize exact penalty function to handle the nonlinear dynamics. Then the proposed algorithm successively convexifies the problem via a $ \textit{project-and-linearize} $ procedure. Thus a finite dimensional convex programming subproblem is solved at each succession, which can be done efficiently with fast Interior Point Method (IPM) solvers. Global convergence to a local optimum is demonstrated with certain convexity assumptions, which are satisfied in a broad range of optimal control problems. The proposed algorithm is particularly suitable for solving trajectory planning problems with collision avoidance constraints. Through numerical simulations, we demonstrate that the algorithm converges reliably after only a few successions. Thus with powerful IPM based custom solvers, the algorithm can be implemented onboard for real-time autonomous control applications.

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

↑