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
書誌事項
- タイトル別名
-
- Search Game for a Mobile Target with th
この論文をさがす
抄録
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.
収録刊行物
-
- 日本オペレーションズ・リサーチ学会論文誌
-
日本オペレーションズ・リサーチ学会論文誌 39 (4), 501-511, 1996
公益社団法人 日本オペレーションズ・リサーチ学会
- Tweet
詳細情報 詳細情報について
-
- CRID
- 1390001204109590912
-
- NII論文ID
- 110001184465
-
- NII書誌ID
- AA00703935
-
- ISSN
- 21888299
- 04534514
-
- NDL書誌ID
- 4098976
-
- 本文言語コード
- en
-
- データソース種別
-
- JaLC
- NDL
- Crossref
- CiNii Articles
-
- 抄録ライセンスフラグ
- 使用不可