Planning problem of object motion through area of random search

The problem is considered of planning the object trajectory that passes through an area of random search. The peculiarity of the problem is that the search area is unknown a priori, but known are the algorithmic and technical characteristics of search means. Two variational formulations of the integral risk minimization problem are proposed, in the absence and in the presence of limitations to the length of the trajectory. Software modules are developed to get numerical solutions of these problems.