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

计算控制不变集是容易的

Computing control invariant sets is easy

Univ. Grenoble Alpes, CNRS, Gipsa-lab(格勒诺布尔阿尔卑斯大学,法国国家科学研究中心,Gipsa实验室)

Mirko Fiacchini, Mazen Alamir

AI总结:

本文研究了线性受控系统在输入和状态受限下的控制不变集计算问题,提出了一种基于线性规划的算法,通过将N步算子的Minkowski加法转化为线性规划问题,克服了传统方法的复杂性限制,并在高维系统中实现了高效和可扩展的计算。

摘要:

在本文中,我们考虑了线性受控系统在输入和状态受限下的控制不变集计算问题。我们特别关注N步算子的计算复杂性,该算子由Minkowski加法定义,是许多迭代方法获得控制不变集的基础。我们提出了涉及N步集的控制不变性集合包含条件,并以线性规划问题的形式呈现。这些条件被用于基于线性规划问题的算法中,以克服集加法固有的复杂性限制,并可应用于高维系统。通过在不到两秒钟的时间内计算出一个状态和输入维度分别为20和10的系统的15步算子的最大控制不变集近似值,展示了该方法的效率和可扩展性。

英文摘要:

In this paper we consider the problem of computing control invariant sets for linear controlled systems with constraints on the input and on the states. We focus in particular on the complexity of the computation of the N-step operator, given by the Minkowski addition of sets, that is the basis of many of the iterative procedures for obtaining control invariant sets. Set inclusions conditions for control invariance are presented that involve the N-step sets and are posed in form of linear programming problems. Such conditions are employed in algorithms based on LP problems that allow to overcome the complexity limitation inherent to the set addition and can be applied also to high dimensional systems. The efficiency and scalability of the method are illustrated by computing in less than two seconds an approximation of the maximal control invariant set, based on the 15-step operator, for a system whose state and input dimensions are 20 and 10 respectively.

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

↑