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

非凸最优控制问题的逐次凸化及其收敛性

Successive Convexification of Non-Convex Optimal Control Problems and Its Convergence Properties

Yuanqi Mao, Michael Szmuk, Behcet Acikmese

摘要:

本文提出了一种求解非凸最优控制问题的算法,其中非凸性可以由非线性动力学、非凸状态和控制约束引起。本文假设状态和控制约束已经是凸的或凸化的,所提出的算法通过线性化,以连续的方式凸化非线性动力学。因此,在每一个序列,一个凸最优控制子问题的解决。由于动力学是线性化的,其他约束是凸的,经过离散化,子问题可以表示为有限维凸规划子问题。由于凸优化问题可以非常有效地解决,特别是使用自定义求解器,因此可以在时间关键型应用中解决这个子问题,例如自动驾驶车辆的实时路径规划。算法中引入了虚拟控制和置信域等安全保护技术,增加了算法的鲁棒性。在连续时间条件下给出了收敛性分析.通过这样做,我们的收敛结果将是独立于任何用于离散化的数值方案。针对说明性轨迹优化示例执行数值模拟。

英文摘要:

This paper presents an algorithm to solve non-convex optimal control problems, where non-convexity can arise from nonlinear dynamics, and non-convex state and control constraints. This paper assumes that the state and control constraints are already convex or convexified, the proposed algorithm convexifies the nonlinear dynamics, via a linearization, in a successive manner. Thus at each succession, a convex optimal control subproblem is solved. Since the dynamics are linearized and other constraints are convex, after a discretization, the subproblem can be expressed as a finite dimensional convex programming subproblem. Since convex optimization problems can be solved very efficiently, especially with custom solvers, this subproblem can be solved in time-critical applications, such as real-time path planning for autonomous vehicles. Several safe-guarding techniques are incorporated into the algorithm, namely virtual control and trust regions, which add another layer of algorithmic robustness. A convergence analysis is presented in continuous- time setting. By doing so, our convergence results will be independent from any numerical schemes used for discretization. Numerical simulations are performed for an illustrative trajectory optimization example.

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

↑