By Topic

Approximate solutions and performance bounds for the sensor placement problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Uddin, M. ; Dept. of Electr. Eng., Univ. of Hawaii, Honolulu, HI, USA ; Kuh, A. ; Kavcic, A. ; Tanaka, T.

This paper considers the placement of m sensors at n > m possible locations. Given noisy observations, knowledge of the state correlation matrix, and a mean square error criterion, the problem can be formulated as an integer programming problem. The solution for large m and n is infeasible, requiring us to look at approximate algorithms. Using properties of matrices, we come up with lower and upper bounds for the optimal solution performance. We also formulate a greedy algorithm and a dynamic programming algorithm that runs in polynomial time of m and n. Finally, we show through simulations that the greedy and dynamic programming algorithms very closely approximate the optimal solution. The sensor placement problem has many energy applications where we are often confronted with limited resources. Some examples include where to place environmental sensors for an area where there are large amounts of distributed solar PV and where to place grid monitors on an electrical distribution microgrid.

Published in:

Smart Grid Communications (SmartGridComm), 2012 IEEE Third International Conference on

Date of Conference:

5-8 Nov. 2012