Brief paper: Hybrid method for a general optimal sensor scheduling problem in discrete time

Authors:
Z. G. Feng;K. L. Teo;V. Rehbock
Affiliations:
College of Mathematics and Computer Science, Chongqing Normal University, Chongqing, PR China;Department of Mathematics and Statistics, Curtin University of Technology, Perth, WA, Australia;Department of Mathematics and Statistics, Curtin University of Technology, Perth, WA, Australia
Venue:
Automatica (Journal of IFAC)
Year:
2008

Citing 8
Cited 0

Optimal sensor scheduling in nonlinear filtering of diffusion processes

SIAM Journal on Control and Optimization
Brief Sensor scheduling in continuous time

Automatica (Journal of IFAC)
Brief Control parametrization enhancing technique for optimal discrete-valued control problems

Automatica (Journal of IFAC)
New approach to information fusion steady-state Kalman filtering

Automatica (Journal of IFAC)
Optimal sensor placement and motion coordination for target tracking

Automatica (Journal of IFAC)
Technical communique: Distributed optimal component fusion weighted by scalars for fixed-lag Kalman smoother

Automatica (Journal of IFAC)
Precision missile guidance using radar/multiple-video sensor fusion via communication channels with bit-rate constraints

Automatica (Journal of IFAC)
On a stochastic sensor selection algorithm with applications in sensor scheduling and sensor coverage

Automatica (Journal of IFAC)

Quantified Score

Hi-index	22.14

Visualization

Abstract

In this paper, we consider a general class of optimal sensor scheduling problems in discrete time. There are N"1 sensors available for acquiring data so as to estimate the needed but unknown signal. Only N"2 out of the N"1 sensors can be turned on at any moment, while different weights can be assigned to different sensors. This problem is formulated as a discrete time deterministic optimal control problem involving both discrete and continuous valued controls. A computational method is developed for solving this discrete time deterministic optimal control problem based on a branch and bound method in conjunction with a gradient-based method. The branch and bound method is used to determine the optimal schedule of sensors, where a sequence of lower bound dynamic systems is introduced so as to provide effective lower bounds for the construction of the branching rules. Each of the branches is an optimal weight vector assignment problem and a gradient-based method is developed for solving this optimal control problem. For illustration, two numerical examples are solved.