Optimal Adaptive Target Shooting with Imperfect Feedback Systems

  • Samuel S. Wu
  • Zuo-Jun Max Shen
  • Mark C. K. Yang
Part of the Cooperative Systems book series (COSY, volume 1)

Abstract

In military combats, a common task is to destroy multiple targets with limited number of missiles. The weapons are not perfect and each can eliminate its target with a certain probability. Suppose after each shot we may receive some information on the state of the target. Realistically these feedbacks are subject to error, thus we will not know for sure whether the target is really destroyed. This research focuses on finding the optimal allocation of missiles so that maximum number of targets can be destroyed, or the probability of destroying all targets is maximized.

Formally, we consider the following sequential target shooting problem. Given a fixed number of targets and missiles, the objective is to find the optimal strategy, where the missiles are fired sequentially at the targets in the attempt to destroy as many targets as possible. The probability of destroying a target at each shot is known and after each shot, a report becomes available on the state of the target: either destroyed or intact. However, the reports are subject to two types of errors and the probabilities of making these errors are also known. We call the report system imperfect if the probability of getting wrong reports is positive.

Note that after each shot, the probability that a target is intact can be evaluated based on the imperfect reports. We have shown that the myopic decision strategy, which always shoots the target with the highest intact probability, is optimal when all the missiles have the same hitting probability and the targets are homogeneous. In addition, techniques for comparing imperfect feedback systems are developed. A partial ordering of the systems is provided when the optimal strategy is carried out.

Keywords

Imperfect Feedback Systems Optimal Sequential Decision Target Shooting Adaptive Decision Rule 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    J. C. Gittins, “Bandit processes and dynamic allocation indices”, J. Roy. Stat. Soc. B., 41: 148–164, 1979.MathSciNetMATHGoogle Scholar
  2. [2]
    J. C. Gittins, Multi-armed Bandit Allocation indices, John Wiley, New York, 1989.MATHGoogle Scholar
  3. [3]
    N. E. Karoui and I. Karatzas, “General Gittins index processes in discrete time”, Proc. Natl. Acad. Sci. USA, 90: 1232–1236, 1993.MATHCrossRefGoogle Scholar
  4. [4]
    A. N. Burnetas and M. N. Kathehakis, “On large deviation properties of sequential allocation problems”, Stochastic Analysis and Applications, 14:23–31, 1996.MathSciNetMATHCrossRefGoogle Scholar
  5. [5]
    A. N. Burnetas and M. N. Kathehakis, “Optimal adaptive policies for sequential allocation problem”, Advances in Applied Mathematics, 17: 122–142, 1996.MathSciNetMATHCrossRefGoogle Scholar
  6. [6]
    D. A. Berry and B. Fristedt, Bandit Problems, Chapman and Hall, New York, 1985.MATHGoogle Scholar
  7. [7]
    Y. M. Dirickx and L. P. Jennergren, “On the optimality of myopic policy in Sequential decision problems”, Management Science, 21: 550–556, 1975.MathSciNetMATHCrossRefGoogle Scholar
  8. [8]
    M. Duflo, Random Iterative Models, Springer, Berlin, 1990.Google Scholar
  9. [9]
    C. Y C. Mo, S. S. Wu, R. Chen, and M. C. K. Yang, “Optimal sequential allocation with imperfect feedback information”, J. Appi Prob., 38: 248–254, 2001.MathSciNetMATHCrossRefGoogle Scholar
  10. [10]
    S. S. Wu, C. X. Ma, and M. C. K. Yang, “On imperfect feedback systems in sequential allocation problem”, submitted to Stat. & Prob. Letters. Google Scholar
  11. [11]
    L. Benkherouf and J. A. Bather, “Oil Exploration: sequential decision in the face of uncertainty”, J. Appl Prob., 21: 529–543, 1988.MathSciNetCrossRefGoogle Scholar
  12. [12]
    G. Schroeter, “Distribution of number of point targets killed and higher moments of coverage of area targets”, Naval Research Logistics Quarterly, 31:373–385, 1984.MathSciNetMATHCrossRefGoogle Scholar
  13. [13]
    M. R. Garey and D. S. Johnson, Computers and Intractability, W. H. Freeman and Company, New York, 1979.MATHGoogle Scholar
  14. [14]
    T. Ibaraki and N. Katoh, Resource Allocation Problems, MIT Press, 1988.MATHGoogle Scholar
  15. [15]
    Z.-J. Shen, S. S. Wu, and Y Zhu, “K-partitioning problem: applications and solutions algorithms”, Technical Note, Dept. of Industrial and Systems Engineering, University of Florida, 2001.Google Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2003

Authors and Affiliations

  • Samuel S. Wu
    • 1
  • Zuo-Jun Max Shen
    • 2
  • Mark C. K. Yang
    • 1
  1. 1.Department of StatisticsUniversity of FloridaGainesvilleUSA
  2. 2.Department of Industrial & Systems EngineeringUniversity of FloridaGainesvilleUSA

Personalised recommendations