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

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.

[1]  Optimal Multiplicative Generalized Linear Search Plan for a Discrete Random Walker , 2013 .

[2]  COORDINATED SEARCH FOR A RANDOMLY LOCATED TARGET ON THE PLANE , 2009 .

[3]  M. El-Hadidy,et al.  Multiplicative linear search for a brownian target motion , 2011 .

[4]  Hugh F. Durrant-Whyte,et al.  Process model, constraints, and the coordinated search strategy , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[5]  Mohamed Abd Allah El-Hadidy,et al.  Parabolic Spiral Search Plan for a Randomly Located Target in the Plane , 2013 .

[6]  Mohamed Abd Allah El-Hadidy,et al.  Optimal multiplicative Bayesian search for a lost target , 2014, Appl. Math. Comput..

[7]  Mohamed Abd Allah El-Hadidy,et al.  Cooperative search model for finding a brownian target on the real line , 2018, Journal of Taibah University for Science.

[8]  M. El-Hadidy,et al.  Existence of a periodic search strategy for a parabolic spiral target motion in the plane , 2013 .

[9]  Diane J. Reyniers.  Co-ordinating Two Searchers for an Object Hidden on an Interval , 1995 .

[10]  Mohamed Abd Allah El Hadidy.  Optimal spiral search plan for a randomly located target in the plane , 2015 .

[11]  Wallace Franck,et al.  On the optimal search problem , 1965 .

[12]  Mohamed Abd Allah El-Hadidy.  On Maximum Discounted Effort Reward Search Problem , 2016, Asia Pac. J. Oper. Res..

[13]  H. Fergany,et al.  On the Coordinated Search Problem on the Plane , 2012 .

[14]  Mohamed Abd Allah El Hadidy.  On the existence of a finite linear search plan with random distances and velocities for a one-dimensional Brownian target , 2020 .

[15]  A. Mohamed.  Optimal searching for a Helix target motion , 2015 .

[16]  M. J. Doosti Deilami,et al.  The Modified Two-Phase Approach to Find Non-negative Target for Inefficient Units in the DEA with Negative Data , 2016 .

[17]  Mohamed Abd Allah El-Hadidy.  Study on the three players' linear rendezvous search problem , 2018 .

[18]  Coordinated Search for a Random Walk Target Motion , 2017 .

[19]  Dan Dai,et al.  Tracking of Moving Target Based on Background Updating and Lifting Wavelet Neural Network , 2013 .

[20]  Mohamed Abd Allah El-Hadidy,et al.  Optimal searching for a randomly located target in a bounded known region , 2015, Int. J. Comput. Sci. Math..

[21]  M. El-Hadidy,et al.  Existence of a finite multiplicative search plan with random distances and velocities to find a d-dimensional Brownian target , 2019, Journal of Taibah University for Science.

[22]  M. El-Hadidy.  Existence of cooperative search technique to find a Brownian target , 2020 .

[23]  M. El-Hadidy.  Fuzzy Optimal Search Plan for N-Dimensional Randomly Moving Target , 2016 .

[24]  Mohamed Abd Allah El-Hadidy,et al.  3-dimensional coordinated search technique for a randomly located target , 2018 .

[25]  Hugh F. Durrant-Whyte,et al.  Recursive Bayesian search-and-tracking using coordinated uavs for lost targets , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..

[26]  Hugh F. Durrant-Whyte,et al.  Optimal Search for a Lost Target in a Bayesian World , 2003, FSR.

[27]  Diane J. Reyniers.  Coordinated search for an object hidden on the line , 1996 .