Theoretical foundation for solving search problems by the method of maximum entropy

The traditional problem of search theory is to develop a search plan for a physical object in the sea or on land. Known algorithms for the optimal distribution of search resources mainly use the exponential detection function. If we consider the search problem more broadly — as a problem of searching for various information, then the detection function can differ significantly from the exponential one. In this case, the solutions obtained using traditional algorithms may be correct from the point of view of mathematics, but unacceptable from the point of view of logic. In this paper, this problem is solved on the basis of the maximum entropy principle. The theorems are proved, as well as their consequences for four types of detection functions, which make it possible to create algorithms for solving various search problems based on the principle of maximum entropy.