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

半连续输入最优控制问题的无损凸化

Lossless Convexification of Optimal Control Problems with Semi-continuous Inputs

Danylo Malyuta, Behcet Acikmese

摘要:

针对一类混合整数非凸最优控制问题,提出了一种新的基于凸优化的全局最优解求解方法。我们考虑非凸约束的问题,限制输入规范为零或下限和上限。将非凸问题转化为凸问题,并证明其最优解在原问题的几乎处处都是最优的,这一过程称为无耗凸化。本文是第一个允许个人输入集重叠,并有不同的范数界,积分输入和状态成本,凸状态约束,可以在离散时间实例激活。该解决方案依赖于二阶锥规划,并证明了一类有意义的最优控制问题的二进制变量可以可靠地解决,在多项式时间。一个推力-框架耦合约束的火箭着陆算例验证了该方法的有效性。

英文摘要:

This paper presents a novel convex optimization-based method for finding the globally optimal solutions of a class of mixed-integer non-convex optimal control problems. We consider problems with non-convex constraints that restrict the input norms to be either zero or lower- and upper-bounded. The non-convex problem is relaxed to a convex one whose optimal solution is proved to be optimal almost everywhere for the original problem, a procedure known as lossless convexification. This paper is the first to allow individual input sets to overlap and to have different norm bounds, integral input and state costs, and convex state constraints that can be activated at discrete time instances. The solution relies on second-order cone programming and demonstrates that a meaningful class of optimal control problems with binary variables can be solved reliably and in polynomial time. A rocket landing example with a coupled thrust-gimbal constraint corroborates the effectiveness of the approach.

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

↑