A deficiency-weighted greedy algorithm solves a multidimensional minimum knapsack problem to select external sensors online while satisfying EKF-derived chance constraints on state estimation error.
Heuristics for the 0-1 min-knapsack problem , journal=
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
eess.SY 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Knapsack-based Online Sensor Selection for Vehicle State Estimation
A deficiency-weighted greedy algorithm solves a multidimensional minimum knapsack problem to select external sensors online while satisfying EKF-derived chance constraints on state estimation error.