THREE PROBLEMS IN SEARCHING FOR A MOVING TARGET BETWEEN TWO SITES  

作　　者：余旌胡 叶文敏 

机构地区：[1]Department of Mathematics,School of Sciences,Wuhan University of Technology

出　　处：《Acta Mathematica Scientia》2015年第2期359-365,共7页数学物理学报（B辑英文版）

摘　　要：Suppose that a moving target moves randomly between two sites and its movement is modeled by a homogeneous Markov chain. We consider three classical problems： （1） what kind of strategies are valid？ （2） what strategy is the optimal？ （3） what is the infimum of expected numbers of looks needed to detect the target？ Problem （3） is thoroughly solved, and some partial solutions to problems （1） and （2） are achieved.Suppose that a moving target moves randomly between two sites and its movement is modeled by a homogeneous Markov chain. We consider three classical problems： （1） what kind of strategies are valid？ （2） what strategy is the optimal？ （3） what is the infimum of expected numbers of looks needed to detect the target？ Problem （3） is thoroughly solved, and some partial solutions to problems （1） and （2） are achieved.

关 键 词：Search theory moving target Markov chain 

分 类 号：O211.62[理学—概率论与数理统计] TP391.41[理学—数学]