This paper considers the planning problem of an object’s optimal path that passes
through a random search region. The problem specifics consist in that the search region is a priori
unknown but the algorithmic and technical characteristics of search means are known. Two
variational statements of the integral risk minimization problem with and without path length
constraints are suggested. Program modules for their numerical solution are also developed.
