|
|
||||||||
School of Management, University of Edinburgh, Edinburgh EH8 9JY, United Kingdom
We consider the optimal use of information in shooting at a collection of targets, generally with the object of maximizing the average number (or value) of targets killed. The shooting problem is viewed as a Markov decision process, and the modal solution technique is stochastic dynamic programming. Information obtained about target status may or may not be perfect, and there may or may not be constraints on the number of shots. Previous results are reviewed, and some new results are obtained.
Operations Research Department, Naval Postgraduate School, Monterey, California 93943
kevin.glazebrook{at}ed.ac.uk
washburn{at}nps.navy.mil
Subject classifications: decision analysis; sequential; dynamic programming/optimal control; Markov finite state; Markov infinite state; military; targeting; probability; Markov processes; stochastic model applications.
History: Received September 2002;
accepted February 2003.
This article has been cited by other articles:
![]() |
K. D. Glazebrook, C. Kirkbride, H. M. Mitchell, D. P. Gaver, and P. A. Jacobs Index Policies for Shooting Problems Operations Research, July 1, 2007; 55(4): 769 - 781. [Abstract] [PDF] |
||||
| HOME | HELP | FEEDBACK | SUBSCRIPTIONS | ARCHIVE | SEARCH | TABLE OF CONTENTS |