.png){kind=icon}
返回
Computing robust control invariant sets of constrained nonlinear systems: A graph algorithm approach
.png){kind=icon}
OA
AI
DOI：10.1016/j.compchemeng.2020.107177.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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. (C) 2020 Elsevier Ltd. All rights reserved.
Keyword:
Nonlinear systems
Outer approximation
Inner approximation
Invariant sets
Graph theory
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
3.9
论文数:
8.1K
被引数:
1.7W
机构
引用论文
A time-dependent Hamilton-Jacobi formulation of reachable sets for continuous dynamic games连续动态游戏的可到达集的时间相关的hamilton-jacobi公式
OAAI
OAAI分享收藏On the computation of invariant sets for constrained nonlinear systems: An interval arithmetic approach.png)
AUTOMATICAOAAI
AUTOMATICAIF5.9
OAAI分享收藏分享收藏分享收藏
查看更多内容