.png){kind=icon}
.png){kind=icon}
Return
Sensor Placement for Fault Isolability Using Low Complexity Dynamic Programming
.png){kind=icon}
PRE
AI
DOI：10.1109/TASE.2014.2372792.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, a novel approach of sensor placement is proposed for the purpose of maximizing fault detectability and isolability. This new approach rests on the basic fact that faults are embedded in the analytical redundancy relations (ARRs) and that the occurrence of a fault will change the consistency of the corresponding ARRs. Based on these basic facts, the minimal isolating (MI) set is introduced to formulate the full/maximal isolability which is the constraint for sensor placement. Consequently, the optimization problem for sensor placement is reformulated as searching an MI set which is related to the least number of candidate sensors. To find the optimal MI set, a low complexity dynamic programming (LCDP) algorithm is developed on the fault set that consists of system faults and sensor faults. However, sensor faults are varied as different candidate sensors are used. Therefore, another dedicated procedure is proposed to handle this issue. A case study shows that the proposed approach outperforms an existing sensor placement approach in terms of efficiency. Note to Practitioners-This paper is motivated by the problem of placing the minimum number of sensors for achieving maximal isolability in a system. Some existing approaches to search the optimal set of candidate sensors generally have performed relatively low efficiency when a system has many more candidate sensors and system faults. This paper suggests a new approach integrated with dynamic programming (DP). DP inherently qualifies an out-performance on searching solutions from large data. In this research, the approach is further improved by reducing the computational and space complexities of DP, resulting in higher efficiency. The case study results demonstrate that this approach has an out-performance in terms of efficiency. In future research, the sensor placement problem takes more requirements such as sensor weight, sensor volume, and sensor reliability, under consideration besides detectability and isolability.
Keywords:
Analytical redundancy relations
dynamic programming
fault detectability and isolability
sensor placement
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.4
Papers:
4.9K
Citations:
1.6W