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

最大脱手控制问题的非凸优化

Non-convex optimization problems for maximum hands-off control

Takuya Ikeda

AI总结:

针对L1范数凸近似无法保证求得最大脱手控制的局限,本文提出一种非凸近似方法构建等价的非凸最优控制问题,并基于凸函数差优化算法求解,通过数值例子验证了其有效性。

摘要:

最大脱手控制是L0最优控制问题的最优解。它在所有可行控制输入中具有最小支撑长度。为避免其组合特性带来的计算困难,通常采用在代价函数中将L0范数替换为L1范数的凸近似方法。然而,这种近似方法不一定能求得最大脱手控制。针对这一局限,本文新引入一种非凸近似方法,并构建了一类始终与最大脱手控制问题等价的非凸最优控制问题。基于这些结果,本文描述了引用为凸函数差优化设计的算法的计算方法。最后,本文通过数值例子证实了该非凸近似方法的有效性。

英文摘要:

The maximum hands-off control is the optimal solution to the L0 optimal control problem. It has the minimum support length among all feasible control inputs. To avoid computational difficulties arising from its combinatorial nature, the convex approximation method that replaces the L0 norm by the L1 norm in the cost function has been employed on standard. However, this approximation method does not necessarily obtain the maximum hands-off control. In response to this limitation, this paper newly introduces a non-convex approximation method and formulates a class of non-convex optimal control problems that are always equivalent to the maximum hands-off control problem. Based on the results, this paper describes the computation method that quotes algorithms designed for the difference of convex functions optimization. Finally, this paper confirms the effectiveness of the non-convex approximation method with a numerical example.

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

↑