谷歌浏览器插件
订阅小程序
在清言上使用

Game theory based optimal sensor placement design for fault detection and isolation

Brijesh Kumar,Mani Bhushan

2023 NINTH INDIAN CONTROL CONFERENCE, ICC(2023)

引用 0|浏览0
暂无评分
摘要
The current work proposes a game theory based approach for optimal Sensor Placement Design (SPD) for Fault Detection and Isolation (FDI) problems. In the proposed approach, both naturally occurring passive faults, as well as attacker induced active faults are considered. Similarly, apart from sensors (active sensors) to be specifically chosen from FDI perspective, existing (passive) sensors chosen for other requirements are also incorporated. The approach is thus suitable for SPD of modern day processes where the process is tightly coupled with automated and increasingly Industrial Internet of Things (IIOT) based control and monitoring systems. In such systems, apart from naturally occurring process faults, faults induced by malicious action of an attacker are also of concern. The SPD problem is formulated as a zero-sum game between attacker (a set of passive and active faults) and detector (a set of passive and active sensors). The game payoff considered in the proposed work incorporates stochastic events such as occurrence of faults and sensor failures. The detector's Nash Equilibrium (NE) strategy is considered to be the optimal SPD for a given FDI problem. The utility of the proposed approach is demonstrated on an illustrative example and a CSTR case study.
更多
查看译文
关键词
Game Theory,Optimal Placement,Sensor Placement,Detector Design,Fault Isolation,Fault Detection And Isolation,Effect Of Noise,Illustrative Example,Internet Of Things,Zero-sum,Active Sensors,Active Faults,Nash Equilibrium,Fault Occurrence,Occurrence Of Failure,Industrial Internet Of Things,Passive Sensors,Sensor Failure,Objective Function,Linear System,Two-player Game,Probability Of Failure,Best Response,Stochastic Manner,Payoff Matrix,Passivation Effect,Pure Strategy,Payoff Function,Security Strategy
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要