返回
Computing control invariant sets of cascade nonlinear systems: Decomposition and distributed computing
DOI:10.1016/j.compchemeng.2023.108142.png)
摘要
En 中文
In this work, we present a distributed framework based on the graph algorithm for computing control invariant set for nonlinear cascade systems. The proposed algorithm exploits the structure of the interconnections within a process network. First, the overall system is decomposed into several subsystems with overlapping states. Second, the control invariant set for the subsystems are computed in a distributed manner. Finally, an approximation of the control invariant set for the overall system is reconstructed from the subsystem solutions and validated. We demonstrate the efficacy and convergence of the proposed method to the centralized graph -based algorithm using several numerical examples including a six dimensional continuous stirred tank reactor system.
Keyword:
Nonlinear systems
Invariant set approximation
Graph theory
Distributed computation
期刊
C
IF:
3.9
论文数:
8.1K
被引数:
1.7W
机构
引用论文
Computing robust control invariant sets of constrained nonlinear systems: A graph algorithm approach
A time-dependent Hamilton-Jacobi formulation of reachable sets for continuous dynamic games连续动态游戏的可到达集的时间相关的hamilton-jacobi公式
On the computation of invariant sets for constrained nonlinear systems: An interval arithmetic approach
AUTOMATICA
IF5.9

