Optimal searching for a randomly located target in a bounded known region (Q2224039)

Summary: This paper addresses the problem of searching for a randomly located target in a bounded known region by a single searcher. The searcher wishes to find the target's position, that is given by the value of the two independent double truncated random variables \((X;Y)\) and they have joint symmetric probability density function \(f(x;y)\). It is desired to search in an optimal manner to minimise the expected value of the time for detecting the target, assuming double truncated circular normal distributed estimates of its position.