An Analysis and Solution of the Sensor Scheduling Problem
From MaRDI portal
(Redirected from Publication:3564117)
Recommendations
- The problem of optimal robust sensor scheduling
- Optimal sensor scheduling in continuous time
- Sensor Scheduling With Time, Energy, and Communication Constraints
- Hybrid method for a general optimal sensor scheduling problem in discrete time
- On the Use of Binary Programming for Sensor Scheduling
- Approximate optimal periodic scheduling of multiple sensors with constraints
- Sensor scheduling in continuous time
- Simultaneous Optimization of Sensor Placements and Balanced Schedules
- A fast localized algorithm for scheduling sensors
- On the Optimal Solutions of the Infinite-Horizon Linear Sensor Scheduling Problem
Cited in
(13)- Mathematical programming techniques for sensor networks
- A Lagrangean-based heuristics for the target covering problem in wireless sensor network
- Robust design of sensor fusion problem in discrete time
- Optimal Sensor Scheduling in Batch Processes Using Convex Relaxations and Tchebycheff Systems Theory
- Scheduling policies for multi-period services
- Application of hybrid metaheuristics in sensor management
- Sensor Scheduling With Time, Energy, and Communication Constraints
- Algorithms for Scheduling Sensors to Maximize Coverage Time
- Optimal Pruning for Multi-Step Sensor Scheduling
- Robust multi-sensor scheduling for multi-site surveillance
- The problem of optimal robust sensor scheduling
- Efficient sensor placement and online scheduling of bin collection
- Folk theorems in repeated games with switching costs
This page was built for publication: An Analysis and Solution of the Sensor Scheduling Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3564117)
