On the construction of resolving control in the problem of getting close at a fixed time moment

The problem of getting close of a controlled system with a compact space in a finite-dimensional Euclidean space at a fixed time is studied. A method of constructing a solution to the problem is proposed which is based on the ideology of the maximum shift of the motion of the controlled system by the solvability set of the getting close problem.

On a representation of the solvability set in the retention problem

The paper provides another iterative method for constructing a resolving set in the game problem of retaining the movements of an abstract dynamic system in given phase constraints. In the iterative procedure, instead of the program absorption operator, it is proposed to use a family of absorption operators for individual program disturbances. Such an approach is based on theorems on the existence and representation of common fix-points of a family of mappings.

Relaxation of the game problem of guidance connected with alternative in guidance-evasion differential game

Differential game (DG) of guidance-evasion for a finite time interval is considered;as parameters, the target set (TS) and the set defining phase constraints (PC) are used.Player I interested in realization of guidance with TS under validity PC uses set-valuedquasistrategies (nonanticipating strategies) and Player II having opposite target uses strategieswith nonanticipating choice of correction instants and finite numbers of such instants.On informative level, the setting corresponds to alternative theorem of N. N. Krasovskii andA. I. Subbotin. For position not belonging to solvability set of Player I, determination ofthe least size of neighborhoods for set-parameters under that Player I guarantees guidance(under weakened conditions) is interested. In article, this scheme is supplemented by priorityelements in questions of TS attainment and PC validity; this is realized by special parameterdefining relation for sizes of corresponding neighborhoods. Under these conditions, a functionof the least size of TS neighborhood is defined by procedure used program iteration methodfor two variants. The above-mentioned function is fixed point for one of two used “program”operators. Special type of the quality functional for which values of the above-mentionedfunction coincide with values of the minimax-maximin games is established.