论文信息 - Stochastic search in a convex region

Stochastic search in a convex region

SummaryA stochastic search strategy is proposed for locating a possibility mobile target in a bounded, convex region of the plane. The strategy is asymptotically minimax as ε→0 with respect to the time required to get within ε of the target. The proof involves the study of first passages to time-dependent boundaries by a certain semi-Markov process.

Steven P. Lalley | Herbert Robbins

[1] Harry Kesten,et al. Renewal Theory for Functionals of a Markov Chain with General State Space , 1974 .

[2] Stochastic Search in a Square and on a Torus , 1988 .

[3] P. Ney,et al. Limit Theorems for Semi-Markov Processes and Renewal Theory for Markov Chains , 1978 .

[4] S. Gal. Search Games with Mobile and Immobile Hider , 1979 .

[5] S. Orey. CHANGE OF TIME SCALE FOR MARKOV PROCESSES , 1961 .

[6] The Princess and Monster Differential Game , 1979 .

[7] H Robbins,et al. Asymptotically minimax stochastic search strategies in the plane. , 1987, Proceedings of the National Academy of Sciences of the United States of America.

[8] Rufus Isaacs,et al. Differential Games , 1965 .

[9] Scott Shorey Brown,et al. Optimal Search for a Moving Target in Discrete Time and Space , 1980, Oper. Res..