Optimal periodic scheduling of sensor networks: a branch and bound approach
From MaRDI portal
Publication:2637590
approximate cost functionapproximation errorarbitrary nonzero suboptimality specificationaverage prediction error variancebranch and boundcommunication constraintsKalman filtersmanageable computation effortnotion of periodic detectabilityoptimal periodic schedulingRiccati equationsSPPS solutionsstate estimationsymmetric periodic positive-semidefinitewireless sensor networks
Recommendations
- Approximate optimal periodic scheduling of multiple sensors with constraints
- Branch and bound method for sensor scheduling in discrete time
- Optimal periodic sensor scheduling for minimizing communication rate under LQG constraint
- Optimal sensor scheduling in continuous time
- Optimal two-sensor scheduling under duty cycle constraint
Cites work
- An algebraic Riccati equation for the discrete-time periodic prediction problem
- Fast Sensor Scheduling for Spatially Distributed Sensors
- scientific article; zbMATH DE number 44406 (Why is no real title available?)
- On a stochastic sensor selection algorithm with applications in sensor scheduling and sensor coverage
- On Optimal Partial Broadcasting of Wireless Sensor Networks for Kalman Filtering
- On stabilizing properties of solutions of the Riccati difference equation
- On the Time-Varying Riccati Difference Equation of Optimal Filtering
- Optimal Periodic Sensor Scheduling With Limited Resources
- Optimal Pruning for Multi-Step Sensor Scheduling
- Periodic systems. Filtering and control
- Sensor selection strategies for state estimation in energy constrained wireless sensor networks
- Sensor Selection via Convex Optimization
- The difference periodic Ricati equation for the periodic prediction problem
- Time-varying discrete Riccati equation: Some monotonicity results
Cited in
(11)- Optimal multiple-sensor scheduling for general scalar Gauss-Markov systems with the terminal error
- Optimal capacity allocation for sampled networked systems
- On fractional derivatives and primitives of periodic functions
- A hyper-heuristic selector algorithm for cloud computing scheduling based on workflow features
- A complete greedy algorithm for infinite-horizon sensor scheduling
- Approximate optimal periodic scheduling of multiple sensors with constraints
- Branch and bound method for sensor scheduling in discrete time
- Periodicity of Kalman-based scheduled filters
- Sensor selection for remote state estimation with QoS requirement constraints
- Optimal periodic sensor scheduling for minimizing communication rate under LQG constraint
- Scheduling parallel Kalman filters with quantized deadlines
This page was built for publication: Optimal periodic scheduling of sensor networks: a branch and bound approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2637590)