Optimal target tracking with restless bandits

This paper examines the problem of adaptive beam scheduling to minimise target tracking error with a phased array radar. It is shown that this can be posed in a framework that is similar to a particular type of dynamic programming problem known as the restless bandit problem. We will show that when the problem is put in this framework it has an indexable solution under certain circumstances.