期刊
IEEE TRANSACTIONS ON SIGNAL PROCESSING
卷 67, 期 9, 页码 2249-2262出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TSP.2019.2903017
关键词
Greedy method; group greedy method; submodularity; sensor placement; linear inverse problem
资金
- Building and Construction Authority (BCA) of Singapore through the NRF GBIC Program [NRF2015ENC-GBICRD001-057]
- National Research Foundation Singapore through the NRF CRP Program [NRF-CRP8-2011-03]
- A*STAR Industrial Internet of Things Research Program under the RIE2020 IAF-PP Grant [A1788a0023]
- Beijing Institute of Technology Research Fund Program for Young Scholars
This paper discusses greedy methods for sensor placement in linear inverse problems. We comprehensively review the greedy methods in the sense of optimizing the mean squared error (MSE), the volume of the confidence ellipsoid, and the worst-case error variance. We show that the greedy method of optimizing an MSE related cost function can find a near-optimal solution. We then provide a new fast algorithm to optimize the MSE. In greedy methods, we select the sensing location one by one. In this way, the searching space is greatly reduced but many valid solutions are ignored. To further improve the current greedy methods, we propose a group-greedy strategy, which can be applied to optimize all the three criteria. In each step, we reserve a group of suboptimal sensor configurations which are used to generate the potential sensor configurations of the next step and the best one is used to check the terminal condition. Compared with the current greedy methods, the group-greedy strategy increases the searching space but greatly improve the solution performance. We find the necessary and sufficient conditions that the current greedy methods and the proposed group greedy method can obtain the optimal solution. The illustrative examples show that the group greedy method outperforms the corresponding greedy method. We also provide a practical way to find a proper group size with which the proposed group greedy method can find a solution that has almost the same performance as the optimal solution.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据