Optimal Selection of Observation Times in a Costly Information Game
Pursuit evasion games with costly and asymmetric information are studied. It is supposed that the evader has perfect information about the position of the pursuer (and himself) at each instant of time whereas the pursuer gets information about the position of the evader only at discrete instants. Furthermore we suppose that the pursuer cannot move during a given period of time while he gathers this information. We investigate both the case in which the instants of observation are chosen by the pursuer in an open loop way (at the beginning of the game) and the case in which he chooses these instants according to the last information obtained (i.e., he chooses in a feedback way).
KeywordsObservation Time Open Loop Differential Game Optimal Selection Dynamic Programming Principle
Unable to display preview. Download preview PDF.
- A.A Melikian, On optimal selection of noise intervals in differential games of encounter. PMM, 37 (2), 1973, 195 - 203.Google Scholar
- P. Bernhard, O. Pourtallier, Pursuit Evasion Game with Costly Infor¬mation. Dynamics and Control.Google Scholar
- P. Bernhard, J. M. Nicolas, O. Pourtallier, Pursuit games with costly in-formation, two approaches. Fifth International Symposium on Dynamic Games and Applications, Grimentz, Switzerland July 1992.Google Scholar
- V. Laporte, J.M. Nicolas, P. Bernhard, About the resolution of discrete pursuit games and its applications to naval warfare. Differential Games- Developments in Modelling and Computation. Springer Verlag, 1991.Google Scholar
- N. S. Pontryagin, Linear Differential Games, I and II. Soviet Math. Doklady 8, 1967.Google Scholar
- G.V. Tomski, Jeux dynamiques qualitatifs, Cahier du CEREMADE n°7934, Universite Paris 9 Dauphine, 1979.Google Scholar