On Multi-Step Sensor Scheduling via Convex Optimization

Details On Multi-Step Sensor Scheduling via Convex Optimization On Multi-Step Sensor Scheduling via Convex Optimization

2012-03-30

arxiv.org/abs/1203.6754v1

Statistics

Applications

6 pages, appeared in the proceedings of the 2nd International Workshop on Cognitive Information Processing (CIP), Elba, Italy,

Scientific paper

10.1109/CIP.2010.5604100

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.

Affiliated with

Also associated with

No associations

Rating

On Multi-Step Sensor Scheduling via Convex Optimization does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Multi-Step Sensor Scheduling via Convex Optimization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Multi-Step Sensor Scheduling via Convex Optimization will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-64207