AN OPTIMAL SEARCH FOR A DISAPPEARING TARGET WITH A RANDOM LIFETIME
スポンサーリンク
概要
- 論文の詳細を見る
We consider an optimal search for a disappearing target with a random lifetime. A stationary target hides in some boxes at the beginning of the search and disappears at some time which is a random variable. A searcher can not detect the target after it disappears. The searcher is given some reward by the detection of the target. He is permitted to use some searching effort with cost for the detection. This paper deals with an optimal distribution of searching effort and an optimal stopping time minimizing the expected risk (the expected cost minus the expected reward) and the conditions of the optimality are obtained. Numerical examples are examined and the relations between this paper and previous studies are discussed too.
- 社団法人日本オペレーションズ・リサーチ学会の論文
著者
-
Iida Koji
National Defense Academy
-
Hohzaki Ryusuke
Department of Applied Physics, National Defense Academy
-
Hohzaki Ryusuke
Department Of Applied Physics National Defense Academy
関連論文
- HIDE-AND-SEAERCH GAME WITH THE RISK CRITERION
- AN OPTIMAL SEARCH FOR A DISAPPEARING TARGET WITH A RANDOM LIFETIME
- PATH CONSTRAINED SEARCH PROBLEM WITH REWARD CRITERION
- AN OPTIMAL INVESTIVATION IN TWO STAGE SEARCH WITH RECOGNITION ERRORS
- DISCRETE SEARCH ALLOCATION GAME WITH ENERGY CONSTRAINTS
- A CONCAVE MAXIMIZATION PROBLEM WITH DOUBLE LAYERS OF CONSTRAINTS ON THE TOTAL AMOUNT OF RESOURCES
- OPTIMAL SEARCH FOR A MOVING TARGET WITH NO TIME INFORMATION MAXIMIZING THE EXPECTED REWARD
- AN OPTIMAL DISPATCH PLANNING OF GUARDS TO COUNTER TO A SUICIDE BOMBER
- A SEARCH GAME WITH DURABLE SEARCHING RESOURCES
- OPTIMAL SURVIVOR SEARCH FOR A TARGET WITH CONDITIONALLY DETERMINISTIC MOTION UNDER REWARD CRITERION
- A SHORTEST PATH PROBLEM ON THE NETWORK WITH AGV-TYPE TIME-WINDOWS
- Rescheduling for AGVs by Time Windows Concept
- A SEARCH GAME WITH REWARD CRITERION
- RANDOMIZED LOOK STRATEGY FOR A MOVING TARGET WHEN A SEARCH PATH IS GIVEN
- AN INTEGER RESOURCE ALLOCATION PROBLEM WITH COST CONSTRAINT
- AN OPTIMAL SEARCH PLAN FOR A MOVING TARGET WHEN A SEARCH PATH IS GIVEN
- Efficient Algorithms for a Convex Programming Problem with a Constraint on the Weighted Total Amount
- A MOVING TARGET SEARCH PROBLEM WITH NESTED CONSTRAINTS OF SEARCH EFFORT