Dynamic search in convex domains

The dynamic search problem with the simple movement of objects in the limited convex domain of the $n$-dimentional Euclidean space is reduced to the similar problem in another domain includes the original one. As an application of the obtained result, the construction of the search trajectory on a plane is presented.