On optimal search technique for a randomly located target

Abstract

In order to modify the time-saving coordination search procedure for a main objective randomly located on one line, a novel search procedure is provided in this paper. From the origin of the line, the search for the hidden target begins with two searchers or robots, and in each particular section of the search, every searcher wants to identify the lost objective (target). The expected time to detect the objective is calculated. For the optimal search procedure, the required conditions are obtained. It introduces an approximation algorithm that makes the procedure easier for searchers to detect the objective. The real-life effective application is illustrated.