A SEARCH GAME FOR A MOBILE TARGET WITH THE CONDITIONALLY DETERMINISTIC MOTION DEFINED BY PATHS

• Iida Koji

  Department of Applied Physics, National Defense Academy

• Hohzaki Ryusuke

  National Defense Academy

• Furui Shingo

  National Defense Academy

Bibliographic Information

Other Title

• Search Game for a Mobile Target with th

Abstract

In this paper, we investigate a search-and-hide game played by a searcher and a mobile target with a conditionally deterministic motion. The target space consists of discrete cells and there are possible target's paths which specify the target's position (cell number) at all times in future. The target, selects one of paths at the beginning of the game and moves along the path thereafter. The searcher knows all possible paths of the target but he cannot know which path is selected by the target. The searcher is restricted by his total searching effort at each time, and allocating it among cells, he searches the target. We formulate this search situation as a two-person zero-sum game and derive the optimal solution. Several examples are examined and the meaning of the optimal conditions are elucidated.

Journal

• Journal of the Operations Research Society of Japan

  Journal of the Operations Research Society of Japan 39 (4), 501-511, 1996

  The Operations Research Society of Japan

Keywords

• Management Science and Operations Research
• General Decision Sciences

Details

• CRID: 1390001204109590912
• NII Article ID: 110001184465
• NII Book ID: AA00703935
• DOI: 10.15807/jorsj.39.501
• ISSN: 21888299
• ISSN: 04534514
• NDL BIB ID: 4098976
• Web Site: https://ndlsearch.ndl.go.jp/books/R000000004-I4098976
• Web Site: https://www.jstage.jst.go.jp/article/jorsj/39/4/39_KJ00001203051/_pdf
• Text Lang: en
• Data Source:
  • JaLC
  • NDL
  • Crossref
  • CiNii Articles
• Abstract License Flag: Disallowed