Minimizing the expected search time of finding the hidden object by maximizing the discount effort reward search

Abstract

A new search technique is developed to locate the hidden target (object) in one of the N-disjoint regions that are not identical. The lost object follows a bivariate distribution. Minimizing the search effort with discount reward has been applied instead of reducing the expected search time. Moreover, the minimum number of searchers is determined in order to minimize the total expected cost. Assuming the object's position has a Circular Normal distribution, the Kuhn–Tucker necessary conditions are implemented to get the optimum search plan.

Keywords

• search theory
• coordinated search technique
• circular normal distribution