Premium
Redundant sensor network design for linear processes
Author(s) -
Ali Yaqoob,
Narasimhan Shankar
Publication year - 1995
Publication title -
aiche journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.958
H-Index - 167
eISSN - 1547-5905
pISSN - 0001-1541
DOI - 10.1002/aic.690411007
Subject(s) - robustness (evolution) , wireless sensor network , computer science , linear programming , reliability (semiconductor) , graph , mathematical optimization , process control , process (computing) , algorithm , mathematics , theoretical computer science , computer network , biochemistry , chemistry , power (physics) , physics , quantum mechanics , gene , operating system
Measurements of process variables have a considerable impact on the control, optimization, safety, and reliability of chemical processes. In a 1993 article, Ali and Narasimhan developed a systematic graph‐theoretic procedure for optimally locating a minimum number of sensors in linear steady‐state processes. The sensor network was designed to maximize the probability of estimating variables when sensors are likely to fail. This article extends that procedure for the optimal design of a redundant sensor network for linear processes. The algorithm proposed also accounts for specifications of measurable and important variables. The efficiency and robustness of the proposed algorithm are demonstrated on realistically large processes.