By Topic

Optimal Scheduling of Scalar Gauss-Markov Systems With a Terminal Cost Function

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
C. O. Savage ; Pima Community Coll., Tucson, AZ ; B. F. La Scala

In this technical note, we consider the problem of optimal measurement scheduling for a particular class of Gauss-Markov systems. These type of scheduling problems arise in applications such as multi-target tracking and sensor management. General solutions to such problems in the Gauss-Markov framework are still the subject of ongoing research. Here, for the first time, we present a set of results for scalar systems, where we consider optimality in the context of minimizing a terminal cost. Complete proofs are given in each case. In some cases, proof outlines have been previously available; other cases are presented here for the first time. For the class of problems considered we demonstrate that simple index policies are optimal. We further examine practical problems in which suboptimal solutions may suffice. Numerical examples are presented for each case.

Published in:

IEEE Transactions on Automatic Control  (Volume:54 ,  Issue: 5 )