Randomized Greedy Sensor Selection: Leveraging Weak Submodularity

Abolfazl Hashemi

doi:10.1109/TAC.2020.2980924

Randomized Greedy Sensor Selection: Leveraging Weak Submodularity

2021-01-01

36

OA

AI

DOI：10.1109/TAC.2020.2980924

原文链接

查看原文

摘要

En 中文

We study the problem of estimating a random process from the observations collected by a network of sensors that operate under resource constraints. When the dynamics of the process and sensor observations are described by a state-space model and the resource are unlimited, the conventional Kalman filter provides the minimum mean square error (MMSE) estimates. However, at any given time, restrictions on the available communications bandwidth and computational capabilities and/or power impose a limitation on the number of network nodes, whose observations can be used to compute the estimates. We formulate the problem of selecting the most informative subset of the sensors as a combinatorial problem of maximizing a monotone set function under a uniform matroid constraint. For the MMSE estimation criterion, we show that the maximum elementwise curvature of the objective function satisfies a certain upper-bound constraint and is, therefore, weak submodular. Building upon the work of Mirzasoleiman et al. on submodular maximization, we develop an efficient randomized greedy algorithm for sensor selection and establish guarantees on the estimator's performance in this setting. Extensive simulation results demonstrate the efficacy of the randomized greedy algorithm compared to state-of-the-art greedy and semidefinite programming relaxation methods.

Keyword:

Greedy algorithms

Covariance matrices

Kalman filters

Radar tracking

Linear programming

Mean square error methods

Noise measurement

Kalman filtering

sensor networks

sensor selection

weak submodularity

Randomized Greedy Sensor Selection: Leveraging Weak Submodularity

摘要

AI总结

期刊

机构

引用论文