A maximum-entropy-based method for alarm flood prediction. (November 2021)

• Record Type: Journal Article
• Authors: Xu, Yizhou; Wang, Jiandong
• Is Part Of: Journal of process control. Volume 107(2021)
• Page Start: 58
• Page End: 69
• Publication Date: 2021-11
• Subjects: Alarm prediction -- Alarm floods -- Maximum entropy principle -- Industrial alarm systems; Process control -- Periodicals; Fabrication -- Contrôle -- Périodiques; Process control; Periodicals; Electronic journals; 660.281
• DOI: 10.1016/j.jprocont.2021.10.002
• Languages: English
• ISSNs: 0959-1524

Abstract

Abstract: Alarm floods are the phenomena of presenting too many alarms in a short time period to exceed abilities of industrial plant operators in making proper responses. This paper proposes a maximum-entropy-based method to predict upcoming alarms for an occurring alarm flood. The proposed method has two important features: all currently-occurred alarms are exploited for prediction, and upcoming alarms are given with quantitative probabilities. By contrast, existing alarm prediction methods either use most-recent (not all) occurred alarms in prediction, or cannot predict specific alarms with quantitative probabilistic values. The proposed method takes all historical alarm flood sequences into account to establish relationships between currently-occurred alarms and upcoming alarms, and formulates an optimization problem to maximize conditional entropies of upcoming alarms. The effectiveness of the proposed method is validated by numerical examples, one of which is on the well-accepted benchmark of Tennessee Eastman process. Highlights: Upcoming alarms in an occurring alarm flood are predicted by maximizing entropies. Relationships among alarms are established from historical alarm flood sequences. All currently-occurred alarms, instead of some of them, are exploited for prediction. Each upcoming alarm is given with a quantitative probability of occurrence. The benchmark of Tennessee Eastman process is taken to validate the proposed method.