Journal
IEEE SIGNAL PROCESSING LETTERS
Volume 25, Issue 6, Pages 793-797Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/LSP.2018.2824761
Keywords
Combinatorics; cost optimization; distributed estimation; structural observability; system digraph
Categories
Ask authors/readers for more resources
In this letter, we discuss cost optimization of sensor networks monitoring structurally full-rank systems under distributed observability constraint. Using structured systems theory, the problem is relaxed into two subproblems: first, sensing cost optimization; and second, networking cost optimization. Both problems are reformulated as combinatorial optimization problems. The sensing cost optimization is shown to have a polynomial-order solution. The networking cost optimization is shown to be NP-hard in general, but has a polynomial-order solution under specific conditions. A 2-approximation polynomial-order relaxation is provided for general networking cost optimization, which is applicable in large-scale system monitoring.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available