A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is
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 dynamicdoi:10.1109/smartgridcomm.2012.6485955 dblp:conf/smartgridcomm/UddinKKT12 fatcat:oix5xrdkcrceninwh3hgdrpcai