Idealized program packages and problems of positional control with incomplete information

The paper is devoted to developing the method of program packages as a tool for investigating problems of positional control with incomplete information. The method is embedded in the field of guaranteed control theory and was stipulated by a number of constructions from this theory. Under the assumption that an a priori given set of initial positions of a controlled system is finite, it is established that the solvability of a guaranteed guidance problem in the class of program packages (or, the same, in the class of positional strategies) is equivalent to the solvability of this problem in the class of considerably simpler program operators, namely, in the class of idealized program packages.