期刊名称：Proceedings of the National Academy of Sciences
印刷版ISSN：0027-8424
电子版ISSN：1091-6490
出版年度：1987
卷号：84
期号：8
页码：2111-2112
DOI：10.1073/pnas.84.8.2111
语种：English
出版社：The National Academy of Sciences of the United States of America
摘要：Stochastic search strategies are proposed for finding a possibly mobile target within a convex region of the plane. The strategies are asymptotically minimax as {varepsilon} [->] 0 with respect to the time required to get within {varepsilon} of the target.
关键词：Princess and Monster game ; semi-Markov processes ; first-passage times
