Optimal Pruning for Multi-Step Sensor Scheduling

Abstract

In the considered linear Gaussian sensor scheduling problem, only one sensor out of a set of sensors performs a measurement. To minimize the estimation error over multiple time steps in a computationally tractable fashion, the so-called information-based pruning algorithm is proposed. It utilizes the information matrices of the sensors and the monotonicity of the Riccati equation. This allows ordering sensors according to their information contribution and excluding many of them from scheduling. Additionally, a tight lower is calculated for branch-and-bound search, which further improves the pruning performance.

6 pages, 3 figures, 1 algorithm, accepted for publication as technical correspondence in IEEE Transactions on Automatic Control

References in corpus (1)

• On Multi-Step Sensor Scheduling via Convex Optimization

Cited by in corpus (3)

• On the Complexity and Approximability of Optimal Sensor Selection and Attack for Kalman Filtering
• Resilient Sensor Placement for Kalman Filtering in Networked Systems: Complexity and Algorithms
• PLATE: A perception-latency aware estimator,