A pursuit and evasion problem with measurement uncertainty
- 42 Downloads
A pursuit-evasion process with uncertain state-dependent measurements, in finite, discrete time and in a finite, discrete state space, is considered. Three types of strategies which might be employed in such a process are compared, and attention is concentrated on the behavior strategy, the least well known of the three types, but often the simplest optimal strategy to employ.
A variation of the Brown-Robinson fictitious play algorithm is presented which can be used to compute behavior strategies in the case of perfect recall processes.
Two examples are given in which optimal behavior strategies are computed using the algorithm and compared with a type of plausible but nonoptimalseparation strategy.
KeywordsState Space Discrete Time Optimal Strategy Measurement Uncertainty Discrete State
Unable to display preview. Download preview PDF.
- 1.Karlin, S.,Mathematical Methods and Theory in Games, Programming, and Economics, Chapter 6, Addison-Wesley Publishing Company, Reading, Massachusetts, 1959.Google Scholar
- 2.Kuhn, H. W.,Extensive Games and the Problem of Information, Contributions to the Theory of Games, Annals of Mathematical Studies, No. 28, Princeton University Press, Princeton, New Jersey, 1953.Google Scholar
- 3.Luce, R. D., andRaiffa, H.,Games and Decisions, Chapter 7, John Wiley and Sons, New York, 1957.Google Scholar
- 4.McKinsey, J.,Introduction to the Theory of Games, Chapter 6, McGraw-Hill Book Company, New York, 1952.Google Scholar
- 5.Robinson, J.,An Iterative Method of Solving a Game, Annals of Mathematics, Vol. 54, No. 2, 1951.Google Scholar