arXiv · 1203.6754
On Multi-Step Sensor Scheduling via Convex Optimization
Abstract
Effective sensor scheduling requires the consideration of long-term effects and thus optimization over long time horizons. Determining the optimal sensor schedule, however, is equivalent to solving a binary integer program, which is computationally demanding for long time horizons and many sensors. For linear Gaussian systems, two efficient multi-step sensor scheduling approaches are proposed in this paper. The first approach determines approximate but close to optimal sensor schedules via convex optimization. The second approach combines convex optimization with a \BB search for efficiently determining the optimal sensor schedule.
Explore related subjects
Keep this discovery
Marco F. Huber. 2012-03-30. On Multi-Step Sensor Scheduling via Convex Optimization. https://doi.org/10.1109/cip.2010.5604100
Cite the original work for its findings. Save a collection to share your selection of sources.