arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2602.04310math.OCcs.SYeess.SY
收藏

一种用于切换系统最优控制的路径完备方法

A Path-Complete Approach for Optimal Control of Switched Systems

UCLouvain(鲁汶大学)

Léa Ninite, Adrien Banse, Guillaume O. Berger, Raphaël M. Jungers

AI总结:

本文提出了一种基于路径完备图的框架,用于构建切换系统价值函数的可计算上界,并通过数值示例验证了其有效性。

摘要:

我们研究了在任意切换情况下离散时间切换系统的价值函数估计问题。不同于切换LQR问题,其中输入和模式序列都被优化,我们考虑了切换为外生的情况。对于此类系统,可能的模式序列数量随时间呈指数增长,使得精确计算价值函数不可行。这促使了开发可计算的上界来近似它。我们提出了一种基于路径完备图的新框架,用于构建价值函数的可计算上界。在该框架中,通过一个编码动态规划不等式的有向图将多个二次函数结合在一起,从而得到凸且可靠的公式。例如,对于具有二次成本的切换线性系统,我们推导出可计算的LMI基于公式,并提供计算复杂性界限。我们进一步为上界建立近似保证,并利用图论的概念证明渐近非保守性。最后,我们将该方法扩展到具有仿射控制输入的系统控制器合成,并在数值示例中展示了其有效性。

英文摘要:

We study the problem of estimating the value function of discrete-time switched systems under arbitrary switching. Unlike the switched LQR problem, where both inputs and mode sequences are optimized, we consider the case where switching is exogenous. For such systems, the number of possible mode sequences grows exponentially with time, making the exact computation of the value function intractable. This motivates the development of tractable bounds that approximate it. We propose a novel framework, based on path-complete graphs, for constructing computable upper bounds on the value function. In this framework, multiple quadratic functions are combined through a directed graph that encodes dynamic programming inequalities, yielding convex and sound formulations. For example, for switched linear systems with quadratic cost, we derive tractable LMI-based formulations and provide computational complexity bounds. We further establish approximation guarantees for the upper bounds and show asymptotic non-conservativeness using concepts from graph theory. Finally, we extend the approach to controller synthesis for systems with affine control inputs and demonstrate its effectiveness on numerical examples.

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

↑