.png){kind=icon}
Return
Optimal Pruning for Multi-Step Sensor Scheduling
.png){kind=icon}
OA
AI
DOI：10.1109/TAC.2011.2175070.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Kalman filtering
linear systems
sensor networks
sensor scheduling
stochastic optimal control
Journal
IF:
7
Papers:
1.3W
Citations:
6.7W
Organization
No organization information available
Cited Papers
ShareSave
ShareSaveOn a stochastic sensor selection algorithm with applications in sensor scheduling and sensor coverage.png)
AUTOMATICA
AUTOMATICAIF5.9
PREAI
ShareSaveSensor selection strategies for state estimation in energy constrained wireless sensor networksAUTOMATICA
AUTOMATICAIF5.9
PREAI
ShareSave no more
no more