Optimal periodic scheduling of sensor networks: a branch and bound approach
DOI10.1016/J.SYSCONLE.2013.04.012zbMath1280.93079OpenAlexW1994980584MaRDI QIDQ2637590
Publication date: 12 February 2014
Published in: Systems \& Control Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.sysconle.2013.04.012
state estimationRiccati equationsbranch and boundKalman filtersapproximation errorwireless sensor networkscommunication constraintsapproximate cost functionarbitrary nonzero suboptimality specificationaverage prediction error variancemanageable computation effortnotion of periodic detectabilityoptimal periodic schedulingSPPS solutionssymmetric periodic positive-semidefinite
Filtering in stochastic control theory (93E11) Estimation and detection in stochastic control theory (93E10) Stochastic scheduling theory in operations research (90B36)
Related Items (7)
Cites Work
- Unnamed Item
- An algebraic Riccati equation for the discrete-time periodic prediction problem
- Periodic systems. Filtering and control
- Time-varying discrete Riccati equation: Some monotonicity results
- Sensor selection strategies for state estimation in energy constrained wireless sensor networks
- On a stochastic sensor selection algorithm with applications in sensor scheduling and sensor coverage
- On stabilizing properties of solutions of the Riccati difference equation
- The difference periodic Ricati equation for the periodic prediction problem
- On the Time-Varying Riccati Difference Equation of Optimal Filtering
- Sensor Selection via Convex Optimization
- Fast Sensor Scheduling for Spatially Distributed Sensors
- Optimal Periodic Sensor Scheduling With Limited Resources
- On Optimal Partial Broadcasting of Wireless Sensor Networks for Kalman Filtering
- Optimal Pruning for Multi-Step Sensor Scheduling
This page was built for publication: Optimal periodic scheduling of sensor networks: a branch and bound approach