TY - GEN
T1 - Sensor placement for reliable observability
T2 - 55th IEEE Conference on Decision and Control, CDC 2016
AU - Liu, Xiaofei
AU - Weerakkody, Sean
AU - Sinopoli, Bruno
N1 - Publisher Copyright:
© 2016 IEEE.
PY - 2016/12/27
Y1 - 2016/12/27
N2 - This paper addresses the problem of reliable sensor placement in large scale linear systems with potentially faulty components. The failure probabilities of individual system components are assumed to be known, and the goal is to place sensor outputs so that the network remains observable with high probability. Two different kinds of system component failures are considered in this paper: 1) the failure of arbitrary sensor devices and 2) the failure of arbitrary connections between pairs of state variables (referred to as a link). In addition, we focus on the design from an economic point of view; thus, we aim to identify the minimum number of state variables that need to be measured to meet desired reliability criteria. We recast this problem as an integer program. Although the integer programming problem is known to be NP-complete, we propose a greedy algorithm and characterize its performance with respect to the optimal solution. Consequently, the proposed approach provides an approximate solution to the problem of minimal sensor placement in the presence of stochastic component failure. Finally, we illustrate the obtained results with an example and simulation analysis.
AB - This paper addresses the problem of reliable sensor placement in large scale linear systems with potentially faulty components. The failure probabilities of individual system components are assumed to be known, and the goal is to place sensor outputs so that the network remains observable with high probability. Two different kinds of system component failures are considered in this paper: 1) the failure of arbitrary sensor devices and 2) the failure of arbitrary connections between pairs of state variables (referred to as a link). In addition, we focus on the design from an economic point of view; thus, we aim to identify the minimum number of state variables that need to be measured to meet desired reliability criteria. We recast this problem as an integer program. Although the integer programming problem is known to be NP-complete, we propose a greedy algorithm and characterize its performance with respect to the optimal solution. Consequently, the proposed approach provides an approximate solution to the problem of minimal sensor placement in the presence of stochastic component failure. Finally, we illustrate the obtained results with an example and simulation analysis.
UR - https://www.scopus.com/pages/publications/85010825431
U2 - 10.1109/CDC.2016.7799100
DO - 10.1109/CDC.2016.7799100
M3 - Conference contribution
AN - SCOPUS:85010825431
T3 - 2016 IEEE 55th Conference on Decision and Control, CDC 2016
SP - 5414
EP - 5421
BT - 2016 IEEE 55th Conference on Decision and Control, CDC 2016
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 12 December 2016 through 14 December 2016
ER -