arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2009.13581eess.SYcs.SYmath.DS
收藏

计算约束非线性系统的鲁棒控制不变集:图算法方法

Computing robust control invariant sets of constrained nonlinear systems: A graph algorithm approach

Benjamin Decardi-Nelson, Jinfeng Liu

摘要:

研究了约束非线性系统的最大鲁棒控制不变集的计算问题。所提出的方法是基于铸造作为一个图论问题的不变集的搜索。具体地说,考虑了一类一般的离散时不变非线性系统。首先,非线性系统的动态近似与有向图。接着,推导了鲁棒控制不变性的条件,并给出了计算鲁棒控制不变集的算法。该算法将迭代细分技术与鲁棒控制不变性条件相结合,在每次迭代中产生最大鲁棒控制不变集的外近似。在此之后,我们证明了算法收敛到最大的RCIS的迭代进行到无穷大。在此基础上,提出了一种计算RCIS内近似的算法。一个特殊的情况下,输入仿射和干扰仿射系统也被认为是。最后,两个数值例子来证明所提出的方法的有效性。

英文摘要:

This paper deals with the computation of the largest robust control invariant sets (RCISs) of constrained nonlinear systems. The proposed approach is based on casting the search for the invariant set as a graph theoretical problem. Specifically, a general class of discrete-time time-invariant nonlinear systems is considered. First, the dynamics of a nonlinear system is approximated with a directed graph. Subsequently, the condition for robust control invariance is derived and an algorithm for computing the robust control invariant set is presented. The algorithm combines the iterative subdivision technique with the robust control invariance condition to produce outer approximations of the largest robust control invariant set at each iteration. Following this, we prove convergence of the algorithm to the largest RCIS as the iterations proceed to infinity. Based on the developed algorithms, an algorithm to compute inner approximations of the RCIS is also presented. A special case of input affine and disturbance affine systems is also considered. Finally, two numerical examples are presented to demonstrate the efficacy of the proposed method.

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

↑