Optimal Pruning for Multi-Step Sensor Scheduling

DOI10.1109/TAC.2011.2175070MaRDI QIDQ5352833zbMATH OpenOpenAlexFDO

Authors Marco F. Huber

Publication date 8 September 2017

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1203.6243

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

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.

Recommendations

• Optimal sensor scheduling in continuous time
• Optimal Scheduling of Multiple Sensors Over Lossy and Bandwidth Limited Channels
• The problem of optimal robust sensor scheduling
• Approximate optimal periodic scheduling of multiple sensors with constraints
• Simultaneous Optimization of Sensor Placements and Balanced Schedules
• Optimal Periodic Sensor Scheduling With Limited Resources
• Optimal sensor scheduling for multiple linear dynamical systems
• Optimal scheduling of multiple sensors over shared channels with packet transmission constraint
• On the Use of Binary Programming for Sensor Scheduling
• An Analysis and Solution of the Sensor Scheduling Problem

Cited in

(8)

• Optimal multiple-sensor scheduling for general scalar Gauss-Markov systems with the terminal error
• Q-learning-based target selection for bearings-only autonomous navigation
• A game theoretic approach to multi-channel transmission scheduling for multiple linear systems under DoS attacks
• Optimal sensor scheduling for multiple linear dynamical systems
• Optimal periodic scheduling of sensor networks: a branch and bound approach
• Sensor selection for Kalman filtering of linear dynamical systems: complexity, limitations and greedy algorithms
• Maximization of nonsubmodular functions under multiple constraints with applications
• Scheduling parallel Kalman filters with quantized deadlines

This page was built for publication: Optimal Pruning for Multi-Step Sensor Scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5352833)