THE OPTIMAL SEARCH PLAN FOR A MOVING TARGET MINIMIZING THE EXPECTED RISK
Kōji Iida, Ryusuke Hozaki · Journal of the Operations Research Society of Japan · 1988
This paper deals with an optimal search problem in which a target moves in a target space stochastically and the amount of search cost being continuously divisible is restricted in certain rate at each time. The optimal. allocation of search effort and the stopping time of the search, which minimize the expected risk, are sought, Necessary and sufficient conditions for the optimal search plan are derived and physical meanings of the conditions are elucidated. An algorithm for numerical calculation of the optimal search plan and examples are also discussed.