Computing control invariant sets of nonlinear systems: decomposition and distributed computing
원문 초록
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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Correlations Are Ruining Your Gradient Descent
SacFL: Self-Adaptive Federated Continual Learning for Resource-Constrained End Devices
Tree-Guided $L_1$-Convex Clustering
Distributed LLMs and Multimodal Large Language Models: A Survey on Advances, Challenges, and Future Directions
Benchmarking Dynamic SLO Compliance in Distributed Computing Continuum Systems
Distributed Mixture-of-Agents for Edge Inference with Large Language Models
토론
이 논문과 연결된 포럼 글이 아직 없습니다.