可观测性
稳健性(进化)
次模集函数
数学优化
非线性系统
离散化
计算机科学
度量(数据仓库)
贪婪算法
模块化设计
数学
控制理论(社会学)
应用数学
人工智能
数据挖掘
控制(管理)
基因
生物化学
物理
数学分析
操作系统
化学
量子力学
作者
Mohamad H. Kazma,Sebastian A. Nugroho,Aleksandar Haber,Ahmad F. Taha
标识
DOI:10.1109/cdc49753.2023.10383254
摘要
This paper explores the problem of selecting sensor nodes for a general class of nonlinear dynamical networks. In particular, we study the problem by utilizing altered definitions of observability and open-loop lifted observers. The approach is performed by discretizing the system's dynamics using the implicit Runge- Kutta method and by introducing a state-averaged observability measure. The observability measure is computed for a number of perturbed initial states in the vicinity of the system's true initial state. The sensor node selection problem is revealed to retain the submodular and modular properties of the original problem. This allows the problem to be solved efficiently using a greedy algorithm with a guaranteed performance bound while showing an augmented robustness to unknown or uncertain initial conditions. The validity of this approach is numerically demonstrated on a$H_{2}/O_{2}$combustion reaction network.
科研通智能强力驱动
Strongly Powered by AbleSci AI