arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2404.15978eess.SYcs.SY
收藏

学习具有凸稳定性约束的深度Koopman算子

Learning deep Koopman operators with convex stability constraints

Marc Mitjans, Liangting Wu, Roberto Tron

AI总结:

提出一种适用于二次规划的离散线性系统稳定性充分条件,通过基于控制屏障函数的投影梯度下降与循环内优化,在数据驱动的Koopman矩阵学习中强制施加渐近稳定性,性能接近SOTA且支持定制化。

摘要:

本文提出了一种离散时间线性系统稳定性的新颖充分条件,该条件可表示为一组分段线性约束,使其适用于二次规划优化问题。更具体地说,我们解决了在迭代梯度下降优化过程中对从数据中学习到的Koopman矩阵施加渐近稳定性的问题。我们证明了该充分条件可按系统矩阵的行解耦,并提出了基于控制屏障函数的投影梯度下降方法,通过在迭代学习过程中运行循环内优化来强制向稳定集逐步演化。我们将算法与文献中其他两种最新方法进行了性能比较,结果表明我们获得了接近最先进水平的性能,同时提供了允许进一步定制优化问题以适应特定应用的额外灵活性。

英文摘要:

In this paper, we present a novel sufficient condition for the stability of discrete-time linear systems that can be represented as a set of piecewise linear constraints, which make them suitable for quadratic programming optimization problems. More specifically, we tackle the problem of imposing asymptotic stability to a Koopman matrix learned from data during iterative gradient descent optimization processes. We show that this sufficient condition can be decoupled by rows of the system matrix, and propose a control barrier function-based projected gradient descent to enforce gradual evolution towards the stability set by running an optimization-in-the-loop during the iterative learning process. We compare the performance of our algorithm with other two recent approaches in the literature, and show that we get close to state-of-the-art performance while providing the added flexibility of allowing the optimization problem to be further customized for specific applications.

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

↑