This study uses two unit-speed searchers to solve the challenge of finding a randomly located target in a bounded region, such as searching for bodies found under the rubble resulting from the erosion of residential units due to horrific natural disasters. The search procedure begins at(0,0). The region is subdivided into a limited even number of cells. The target's position has a symmetric probability distribution. It is preferable to search in an optimal method in order to reduce the predicted time for discovering the target. An algorithm is used to generate the optimal search strategy. We discuss an example when the target has a symmetric truncated normal distribution. We provide an illustrated case to demonstrate this technique's applicability.
No takes yet. Share an insight, caveat, or question.
Mohamed Abd Allah El‐Hadidy (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: