The elements of the operator convexity in the construction of the programmed Iteration Method Текст научной статьи по специальности «Математика»

MSC 37N35, 65J15, 47J25, 52A01, 91A25

DOI: 10.14529/ mm p 160307

THE ELEMENTS OF THE OPERATOR CONVEXITY IN THE CONSTRUCTION OF THE PROGRAMMED ITERATION METHOD

D.A. Serkov, Krasovskii Institute of Mathematics and Mechanics, Ural Branch, Russian Academy of Sciences; Ural Federal University, Ekaterinburg, Russian Federation, [email protected],

A.G. Chentsov, Krasovskii Institute of Mathematics and Mechanics, Ural Branch, Russian Academy of Sciences; Ural Federal University, Ekaterinburg, Russian Federation, [email protected]

The problem of retention studied here can be regarded (in the case of bounded control interval) as a variant of the approach problem within the given constraints in the phase space and the target set given by the hyperplane of the space positions corresponding to the terminal moment of the process (the retention problem on the infinite horizon also fits the problem stated in the work). The main difference of the problem from the previously considered formulation is the possibility of variation of the spaces of system trajectories and disturbance realizations depending on the initial moment of control. It is shown that the unsolvability set of the retention problem is the operator convex hull of the empty set constructed on the base of programmed absorption operator. Under some additional coherence conditions (on the spaces of system trajectories and disturbance realizations corresponding to different initial moments) the set of successful solvability is constructed as the limit of the iterative procedure in the space of sets, elements of which are positions of the game; in this case the structure of resolving quasistrategy is also given.

Keywords: programmed iterations; operator convexity; quasistrategies.

Introduction

In the works [1,2] of N.N. Krasovskii and A.I. Subbotin a fundamental theorem on the alternative in nonlinear differential game has established. The result has directed the development of the differential games theory and provided the basis of effective methods of solving. This theorem determines the split of the game positions into the sum of two sets, one of which corresponds to a successful solvability of the approach problem by one player, and the second set - to a successful solvability of the evasion problem by another player. The players strive to achieve their goals using a positional strategies [1-3]. An important generalization of this theorem obtained by A.V. Kryazhimskii [4] in application to the controlled systems that are not Lipschitz with respect to phase variable.

The problem of retention studied in this work might be regarded as a variant of the approach problem within the given constraints in the phase space and the target set given by the hyperplane of the space positions corresponding to the terminal moment of the process (the retention problem on the infinite horizon also fit to the problem statement in the work). This problem, on the one hand, has a lot of applications, and on the other -plays an important role in solution of the above pursuit-evasion differential games as the requirement of holding the trajectory of the controlled system within N.N. Krasovskii's stable bridge [3, §39].

In theory of differential games it is natural to use the programming constructions that define the solution in so called regular case [2,3,5,6]. In more general cases the idea

of programmed control can also be implemented in solution as an iterative process. In this regard, recall the works [7-13] on the differential games for traditional controlled systems (with Lipschitz condition on the phase variable and the sub-linear growth condition on the differential equation), which dealt with a decision based on the method of programmed iterations (MPI). The above-mentioned generalization by A.V. Kryazhimskii of the alternative theorem was followed by the works on MPI for systems that satisfy more general conditions similar to those of [4]; see, in particular, [14] and several follow-up studies of one of the authors. These studies were associated with the game solution in the class of multivalued quasistrategies (see [8-10,14,15]).

It was also noted the relation of MPI and methods of the axiomatic theory of convexity [16], namely: iterative procedure [17] that is dual to MPI, admits a natural interpretation in terms of prehull operator [16, p. 12]. This relation was studied in [17] for the case of "ordinary" differential games. Later (see [18,19], etc.), the MPI scheme was extended to problems with abstract dynamics, including a direct version of the method (see [20-22]).

In this study, the approach [17] is extended to the abstract retention problem: on the basis of the scheme [18,19] for problem of retention of trajectories in phase constraints it is constructed both direct and dual iterative procedures in the space of sets, and the latter is reduced to the construction of operator-convex hull of empty set.

The essential difference of the paper from [23] is the variability of the spaces of the system trajectories and the disturbance realizations depending on the initial moment. Nevertheless, an additional consistency condition required for construction of the resolving quasistrategy.

It is shown that the unsolvability set of the retention problem is the least element of the convexity constructed on the base of programmed absorption operator; under some additional consistency conditions (on the spaces of system trajectories and disturbances realisations corresponding to the different time moments) the result of the direct MPI procedure is the set of successful solvability of the retention problem in the space of positions of the game; for the case the structure of resolving quasistrategies is also provided. The horizon of the control problem is not assumed to be bounded; note in this connection the works [24,25].

1. General Concepts

Common notation. Hereinafter, we use the set-theoretic symbols (quantifiers, propositional bundles, 0 - the empty set); = - equality by definition; "def" replaces the phrase "by definition". We accept the axiom of choice. The set consisting of sets is called family. If Z is the family of subsets (s/s) of the set Z, then we denote by CZ[Z] its dual family: Cz[Z] = {Z \ Z : Z E Z}.

By P(T) (by P'(T)) we denote the family of all (all nonempty) s/s of an arbitrary set T; the family P(T) also called Boolean of the set T. If A and B are non-empty sets, then BA is def the set of all mappings from the set A to the set B (see [26]). If f E BA and C E P'(A), then (f | C) E BC is def the contract ion of f on the set C: (f | C )(x) = f (x) Vx E C. In the case when F E P'(BA), we denote (F | C) = {(f | C) : f E F}. If z is an ordered pair, that is z = (a, b) for some objects a and b, then by pr1(z) and pr2(z) we denote, respectively, the first and the second elements of z, that are uniquely determined by the condition z = (pr1 (z), pr2(z)); so, it is clear, that pr1(z) = a and

pr2(z) = 6. Let N — {1; 2;...} and No — {0} U N (then No = {0; 1; 2;...}). For an arbitrary set E, a sequence (Aj)ieN E P(E)N and a set A E P(E) we, as usual, define

((At)l&i | A) U ((A = n^ Ai)&(AJ+1 c Aj Vj e N)).

Elements of topology. If (V,t) is a topological space (TS) and Z E P(V), then t\z — {Z fl G : G E t} is the topology of Z that realizes in the form of TS (Z,t\z) is the subspace of (V, t); If (Z,t^d (Z', t') are TS, then t ® t' denotes the standard product topology of (Z, t^d (Z', t') (see e.g. [27, section 2.3]), the base of which consists G x GG, G E t, G' E t'. If (V, t) is TS and v E V, then using Nr (v) we refer to the filter of all neighborhoods of v [28, Ch. 1].

Spaces with convexity. In the axiomatic theory of convexity the space with convexity corresponds to the equipment of some non-empty set by the special family of its subsets (see [16, p. 9]), that on the level of ideas is similar to the equipment by a topology. An natural example of convexity gives a family of closed sets in TS, that is, the closed topology in the terminology of P.S. Aleksandrov [29, p. 98]. Of course, the usual convexity, implemented in linear spaces, "fits" the axiomatic construction of convexity [16].

Important element of the axiomatic theory of convexity are the concepts of convex hull and prehull. It turned out [17], that MPI in dual form is completely characterized by prehull in so-called operator convexity (see [16, p. 11]). From this view point one of the sets in the above alternative partition, corresponding to the approach problem, might be presented as a convex hull of the empty set. In the paper, the presentation is extended to the case of abstract retention problem.

We recall (see [16, p. 9]) that nr every nonempty sets H an arbitrary family H E P(P(H)) for which (H E H)&(f|Hee H E H VC E P(H)) is called the convexity on H. Using (CONV)[H] denote the set of all convexities on H, that is

(CONV)[H] — {H E P(P(H)) \ (H E H)&(f| H E H VC E P(H))}. (1)

Hee

If H E (CONV)[H], then for every set S E P(H) the nonempty (see (1)) family [H](S) — {H E H \ S c H} of all sets from H containing S, is determined and we can define the intersection

(H-hu 11)[S] — p| H e P(H), (2)

HeiHKS1)

HS hull of S. It is clear that (^u 11)[S] c A VA E [H](S).

If Q E P'(P(H)) and J E P(H)Q, then we may define the corresponding J-operator H

(^^nv)[H] — {A E P(H) \ VB E Q (B C A) ^ (J(B) C A)}; (3)

according to [16, theorem 1.3] (J-conv)[H] E (^ONV)[H] (the family Q is the domain of JJ Following [16, p. 12], we introduce the notion of (convex) prehull, specifying the set

(p-HULL)[H] — {g E P(H)p(h) \ (E C g(E) VE E P(H)) &

&(VE E P(H) VE' E P(H) (E C E') ^ (g(E) C g(E')))}; (4)

the mappings from the set (4) are called prehulls on H.

The definition (3) can be applied for the case when Q = P(H) and J E (p-HULL)[H]. According to [16, Lemma 1.1] in this case

(J-con v)[H] = {A E P(H) I A = J (A)} У J E (p-HULL)[H]. (5)

The Abstract Dynamic System. Hereinafter we fix a nonempty s/s / of real numbers R as an analogue of the time interval and a nonempty set X corresponding to the phase space. Let D = / x X be the set of space positions. If t E /, then we define /t = {С E / I С < t} Mid It = {С E / I С > tMf t E E It, than I{te) = /в П It-

For a nonempty set L we determine Boolean P(/ x L) of the (nonempty) set / x L and consequently, Llt E P'(P'(/ x L)) (we identify mappings from It into L with their graphs, receiving a nonempty s/s of / x L). Thus, we have a family Ute/ Llt and its Boolean. So, defined the family P'(UtejLlt) = P(UteJLlt) \ {0} hence, for arbitrary 9 E / the relation P'(UtejLlt) П P'(Lle) = P'(Lle) holds. In other words, for the set L the mapping 9 м Lle : / м P'(UtejLlt) is defined, and, therefore, we have a nonempty set (Pack)[L] = Пв j- P'(Ll). Fix an arbitrary nonempty set Y and choose (nonempty by construction) sets (Ct)tej E (Pack)[X] and (Qt)tej E (Pack)[Y]. Then for t E / we have the properties Ct E P'(Xlt), Qt E P' (Ylt ); in particu 1 ar, Ct С Xlt, Qt С Ylt. A mapping

It X Ct t E /

elements ш E Qt are considered as realisations of uncertain factors on "interval" It. And at last, let us define as the analogue of a dynamical system the mapping (more precisely, an indexed family of mappings)

(StW E П P (Ct)X xQt. (6)

Ш

From (6) it follows, of course, that for t E / the operator St : X x Qt м P'(Ct) is defined; for this operator, in its turn, the cross-section at ж E X is defined as mapping St(x, •) of the form ш м St(x, ш) : Qt м P'(Ct). Since for z E D pr^z) E ^d pr2 (z) E X, then §(г,ш) = Sprit^)(pr2(z),ш) E P'(Ct) is defined for all ш E Qt. Therefore, if t E /, x E X and ш E Qt, then we have the set

S((t,х),ш) E P'(Ct). (7)

So, for z E D (i.e. z = (t,x), where t E / and x E X) and ш E Qt the set S(z,ш)

z

ш ш It

connection, we introduce for t E / the set Mt = P(Ct)Qt of all multi-functions (m/f) on Qt with values in Ct: а(ш) С Ct for ш E Qt, a E Mt. Given t E / and a E Mt, the m/f а is said to be non-anticipating, if for all ш E Qt ш' E Q^d С E It:

((ш I It?))) = ((ш' I It?))) ^ ((а(ш) I It?)) = (а(ш') | It?))). (8)

We presume, that the control side uses for the purpose of forming trajectories nonempty valued m/f from Mt with the property (8). Thus, when (t,x) E D the set

M tt,x) = {a E Д P' (S((t, x), ш)) У E Qt Уш' E Qt У С E It

((ш I If) = (ш' I It?))) ^ (( а(ш) I 4«) = (а(ш') I It?)))} (9)

(of (multivalued) quasistrategies corresponding to the position (t,x)) is considered as the set of procedures acceptable for the control side. Having a particular control target, we consider it attainable for a given position (t,x) E D, if there exists the quasistrategy a0 E M(t^), for which the target is achieved on each trajectory from the set Uwenta0(u).

We fix the topology t on the set X and postulate that (X, t) is a T2-space. By F we denote the family of all s/s of X, closed in (X,t). The topology D on the set D is assumed to be the product of the topologies P(I) (the discrete topology on I) and t: (D, D) = (D, P(I) 0 t). We agree that

H(t) = {x E X | (t,x) E H} VH E P(D) Vt E I. (10)

In accordance with (10) for all H E P(D) we have

H = {(t,x) E D I x E H(t)}. (11)

Using (10) and the definition of D, it is easy to see that the family F of all s/s of D, that (D, D)

F = {F E P(D) I F(t) E F Vt E I} (12)

(i.e., F is the family of s/s of D with cross sections closed in (X,t)).

For every t E I we equip the set Xlt by standard topology 0lt (t) of Tikhonov's degree of TS (X, t), provided that It is used as the index set. On the set Ct we define the topology Ct of subspaces of T2-space (Xlt, 0lt (t)), i.e. Ct = {Ct H G : G E (t)}, receiving, as a result, T2-space (Ct, Ct). ^n other words, (Ct, Ct) is the set Ct in the topology of point-wise convergence. Furthermore, for t E I we introduce the families Ft and Kt of all s/s of Ct, that are, respectively, closed and compact in TS (Ct, Ct).

2. The Programmed Absorption Operator

If H E P(D), z E D and u E Hp^), assume that

n(u I z, H) 4 {s e S(z,u) I (£,s(0) E H V£ E IpriW}. (13)

t E I x E X

n(u I (t,x),H) 4 {s E S((t,x),u) I s(0 E H(£) V£ E It}. (14)

It is easy to check that for any (t, x) E D, u E Ht and H E P(D) the equality holds

n(u I (t,x),H) = n(u I (t,x),H H (It x X)). (15)

In terms of (13) we introduce the programmed absorption operator (PAO) A : P(D) ^ P(D), namely, we assume that VH E P(D)

A(H) 4 {z e H I n(u I z,H) = 0 Vu E Hpr1(z)}. (16)

We consider (16) as a kind of game operator, which, however, can be associated with the system of non-game mappings: if t E I, u E Qt, the operator Aw [t] : P(D) M- P(X) is determined by the condition

Aw[t](H) 4 {x e H(t)I n(u I (t,x),H) = 0} VH E P(D). (17)

The relations between PAO and the family Aw[t], t G I, u G Qt, defined in (17), is given by the following easily verifiable statements.

Proposition 1. Ift G I and H G P(D), then A(H)(t) = HweQt Aw[t](H). Corollary 1 .If H G P(D), the n A(H ) = {(t,x) G D | x G Aw [t](H )}.

We introduce iterations (Ak)keNo : N0 m P(D)p(d) of the operator A in an ordinary

way

(A0(H ) 4 H y H G P(D))&(Ak+1 4 A o Ak Vk G N). (18)

œ

Now define the limit operator A : P(D) m P(D), assuming that

œ

A(H) = p| Ak(H) VH G P(D). (19)

keNo

œ

Proposition 2 .If F G P(D) an d H G P(F ), then (H = A(H )) ^ (H C A(F )).

Conditions 1, 2 and 3 will be used in the following, however, every time the use of this or that condition will be specially pointed out.

Condition 1. [Closedness of value] Ift G I, x G X mid u G Qt, then S((t,x),u) G Ft.

Condition 2. [Closedness of graph] Ift G I mid u G Qt, then

{(x,h) G X x Ct | h G S((t,x),u)}GCxxCt [t 0 C].

Condition 3. [Precompactness of values] Ift G I, x G X mid u G Qt, then 3H G Nr (x) 3K G Kf" S((t, y), u) C K Vy G H.

Note that condition 1 is the consequence of condition 2.

Proposition 3. Let conditions 2 and 3 are fulfilled. Then Aw [t](F ) G F for a II t G I, u G Qt an d F G F.

Propositions 1, 3 with (12) implies following corollary.

A(F) G F Ak(F) G F

œ

A(F) G F F G F k G N0

Proposition 4. Let conditions 1 and 3 are fulfilled. Then for an arbitrary (Nj)jeN G FN

œœ

and N G P(D) the implication holds ((Ni)ieN | N) ^ ((A(Ni))ieN | A(N)).

The proof of the proposition begins with verifying the sequential continuity of the operator Аш[t]: ((Fi)ieN | F) ^ ((Аш[t](Fi))ieN | Аш[t](F) for all t G /and ш G fit). Then, taking into account propositions 2, we get the sequential continuity of the operator

A: ((Fi)ieN l F) ^ ((A(Fj))ieN ^ A(F)). This property ensures, sequential continuity of

k ж

the operators A , k G N and, consequently, their limit - operator A.

ж

A

ж ж

Proposition 5. Let conditions 2, 3 are fulfilled and F G F. Then A(A(F)) = A(F).

As a consequence, under conditions 2, 3, F G F and H G P(F) the inclusion holds (A(F) c H) ^ (A(F) = A(H)).

3. Connection with the Operator Convexity

Everywhere further we fix a set N G P(D) (in the context of retaining problem the set N is used as a phase restriction). We consider the operator A : P(N) ^ P(N) defined as follows

A(H ) 4 N \ A(N \ H ) y H G P(N). (20)

In connection with (20) consider the family

(A-conv)[N] 4 {H g P(N) | yB G P(N) (B c H) ^ (A(B) c H)},

that provide (see (3)) the corresponding operator convexity: (A-conv)[N] G (CONV)[N]. Proposition 6. The operator A is prehull: A G (p-HULL)[Nj.

A

From propositions 6 in virtue of [16, Lemma 1.1] (see (5)) it follows that (A-conv)[N] = {H G P(N) | A(H) = H)}. We define the convex hull in the convexity (A-conv)[N] for any S G P(N) following (2):

((A^onv)[N]-hull)[S] = p| H g (A-conv)[N]. (21)

v)[N]](S)

The next assertions are consistent with [17] in the case of positional differential games.

tx

In this regard, recall that A(N) G P(N) (see (18), (19)).

N G F

The proposition 5 and definition (20) implies

t

Proposition 7. Let conditions 2 and 3 are fulfilled. Then N \ A(N) G (A-conv)[N].

Note that (21) is defined also for S = 0. From propositions 7 it follows that (see (2))

t

((A-conv)[N]-hull)[0] c N \ A(N). Taking into account the proposals 2 and 7 verified

t

Theorem 1. If conditions 2 and 3 hold, then ((A-conv)[N]-hull)[0] = N \ A(N).

t

Corollary 3. If conditions 2 and 3 are true, then N \A(N) is the least element of convexity

(A-conv)[N]. In particular,

tt (H G P(N \ A(N))) ^ (((A-conv)[N]-hull)[H] = N \ A(N)).

4. Coherence of the Spaces Packages and the Solvability in Quasistrategies

Recall that in the above there were no suppositions on any consistency of the sets Ctl, Ct2 for arbitrary t\ G I, t2 G I, t\ = t2- The same is true for t he sets Qt, t G /.In this paragraph we assume that for any t G I, t' G It

C = {(h I It') : h G Ct}, Qf = {(^ | It') : w G (22)

Some kind of the semi-group property will be used; in this regard, note that due to (22) for t G I, u G fit, t' G It and x' G X the set S((t',x'), (u | It )) G P(C) is well defined.

Condition 4. [Semi-group property] (h | It') G S((t',h(t')), (u | It')) for all (t,x) G D, u G fit, h G §((i,x),u^d t' G It.

Proposition 8. If condition 4 holds, then for any t* G I, u* G fit» and H G P(D) the equality AMt [t*](H) = AMt [t*]({(t,x) G It» x X | x G AMit)[t](H)}) is fulfilled.

Proposition 9. Let condition 4 is true. Then for any N G P(D) an d F G P(N )

(F = A(F )) ^ (3H G P(N) : F (t) = Aw [t](H) Vt G I Vu G fit).

Consider the retaining problem in the class of multivalued quasistrategy, keeping

t G I t G It h G Ct h' G Ct' the map hDh' : It m X (splice of h and h') is defined by ((hDh')(£) 4 h(Ç) VÇ G I(t'))&((hDh')(Z) 4 h'(Z) VZ G It' \ {t'}).

(t, x) G D t G It u, u G fit ((u | Iit')) = (u' | )) ^ (hDh' G S((t, x),u') Vh G S((t,x),u) Vh' G S((t',h(t')), (u' | If ))).

Note that the next statement doesn't use defined below condition 6 of disturbances splice admissibility. This expands the statement range of use including, in particular, practically important case of "continuous" disturbances.

œœ

Proposition 10. If conditions 2, 3 and 5 are true, then n(- | z, A(N)) G Mz Vz G A(N).

The proof of the statement is based on propositions 5. According to proposition 10 and definition (13) we have

œ œ œ

(t, s(t)) G A(N) Vz G A(N) Vu G fipri(z) Vs G n(u | z, A(N)) Vt G IpriW. (23)

œ

From (18), (19) and (23) it follows that (t,s(t)) G N for all z G A(N), u G fipri(z),

œœ

s G n(u | z, A(N)) and t G Ipri(z^ ^tas, for z G A(N) we have got the explicit form of

N

For arbitrary t G I, t' G It, u G fit and u' G fit' ^te m ap u o u' : It M y (splice of u and u') is defi ned by ((u o u' )(£) 4 u(£) VÇ G l(t'))&((u o u' )(Z ) 4 u' (Z ) VZ G If \ {t'}).

u o u G fit t G I t G It u G fit

u G fit

The proof of the next theorem is similar to that in [18,23]. Theorem 2. Let conditions 2-6 are fulfilled. Then the equality holds:

œ

A(N) = {z G N ^a G Mz : (t, s(t)) G N Vt G Ipri(z) Vu G fipri(z) Vs G a(u)}.

Acknowledgements. The work was supported by Russian foundation for basic research (grants No. 16-01-00649, No. 16-01-00505) and the decision No. 211 of the Russian Government, the contract No. 02.AOS.21.0006.

References

1. Krasovskii N.N., Subbotin A.I. An Alternative for the Game Problem of Convergence. Journal of Applied Mathematics and Mechanics, 1970, vol. 34, no. 6, pp. 948-965. DOI: 10.1016/0021-8928(70)90158-9

2. Krasovskii N.N., Subbotin A.I. Game-Theoretical Control Problems. N.Y., Springer, 1988. 517 p.

3. Krasovskii N.N. Igrovye zadachi o vstreche dvizhenii [Game Problems on Motions Encounter]. Moscow, Nauka, 1970. 420 p.

4. Kryazhimskii A.V. [On the Theory of Positional Differential Games of Approach-Evasion]. Doklady Akademii Nauk SSSR, 1978, vol. 239, no. 4, pp. 779-782. (in Russian)

5. Krasovskii N.N. [Differential Game of Pursuit-Evasion. 1]. Izvestiya Akademii Nauk SSSR. Tekhnicheskaya Kibernetika, 1973, no. 2, pp. 3-18. (in Russian)

6. Krasovskii N.N. [Differential Game of Pursuit-Evasion. II]. Izvestiya Akademii Nauk SSSR. Tekhnicheskaya Kibernetika, 1973, no. 3, pp. 22-42. (in Russian)

7. Chentsov A.G. [On the Structure of an Approach Problem]. Doklady Akademii Nauk SSSR, 1975, vol. 224, no. 6, pp. 1272-1275. (in Russian)

8. Chentsov A.G. On a Game Problem of Converging at a Given Instant of Time. Mathematics of the USSR-Sbornik, 1976, vol. 28, no. 3, pp. 353-376. DOI: 10.1070/SM1976v028n03ABEH001657

9. Chentsov A.G. On a Game Problem of Guidance. Soviet Mathematics - Doklady, 1976, vol. 17, pp. 73-77.

10. Chentsov A.G. On a Game Problem of Guidance with Information Memory. Soviet Mathematics - Doklady, 1976, vol. 17, pp. 411-414.

11. Chistyakov S.V. On Solving Pursuit Game Problems. Journal of Applied Mathematics, 1977, vol. 41, no. 5, pp. 845-852. DOI: 10.1016/0021-8928(77)90167-8

12. Ukhobotov V.I. Construction of a Stable Bridge for a Class of Linear Games. Journal of Applied Mathematics, 1977, vol. 41, no. 2, pp. 350-354. DOI: 10.1016/0021-8928(77)90021-1

13. Melikyan A.A. The Value of a Game in a Linear Differential Game of Convergence. Soviet Mathematics - Doklady, 1977, vol. 18, pp. 1457-1461.

14. Chentsov A.G. The Programmed Iteration Method for a Differential Pursuit-Evasion Game. Dep. in V IN I'll. no. 1933-79, Sverdlovsk, 1979. (in Russian)

15. Chentsov A.G. [About Alternatives in the Class of Quasistrategies for Differential Games of Approach-Evasion], Differentsial'nye uravneniya [Differential equations], 1980, vol. 16, no. 10, pp. 1801-1808. (in Russian)

16. Soltan V.P. Vvedenie v aksiomaticheskuyu teoriyu vypuklosti [Introduction to Axiomatic Theory of Convexity]. Chisinau, Shtinnitsa, 1984. 224 p.

17. Chentsov A.G. On the Problem of Control with a Limited Number of Switching. Dep. in V IN 111. no. 4942-B 87, Sverdlovsk, 1987. (in Russian)

18. Chentsov A.G. An Abstract Confinement Problem: a Programmed Iterations Method of Solution. Automation and Remote Control, 2004, vol. 65, no. 2, pp. 299-310. DOI: 10.1023/B:AURC.0000014727.63912.45

19. Chentsov A.G. On Interrelations Between Different Versions of the Method of Program Iterations: A Positional Version. Cybernetics and Systems Analysis, 2002, vol. 38, no. 3, pp. 422-438. DOI: 10.1023/A:1020368828661

20. Chentsov A.G. On the Iterative Realization of Nonanticipating Multivalued Mappings. Russian Mathematics, 2000, vol. 44, no. 3, pp. 63-73.

21. Chentsov A.G. Nonanticipating Multimappings and Their Construction by the Method of Program Iterations: I. Differential equations, 2001, vol. 37, no. 4, pp. 498-509. DOI: 10.1023/A: 1019275422741

22. Chentsov A.G. Nonanticipating Multimappings and Their Construction by the Method of Program Iterations: II. Differential equations, 2001, vol. 37, no. 5, pp. 713-723. DOI: 10.1023/A: 1019224800877

23. Serkov D.A., Chentsov A.G. [Programmed Iteration Method and Operator Convexity in an Abstract Retention Problem]. Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp'yuternye Nauki, 2015, vol. 25, no. 3, pp. 348-366. (in Russian) DOI: 10.20537/vml50305

24. Dyatlov V.P., Chentsov A.G. Monotone Iterations of Sets and Their Applications to Game Control Problems. Kibernetika, 1987, vol. 23, no. 2, pp. 92-99.

25. Ivanov V.M., Chentsov A.G. On the Control of Discrete Systems on an Infinite Time Interval. USSR Computational Mathematics and Mathematical Physics, 1987, vol. 27, no. 6, pp. 116-121. DOI: 10.1016/0041-5553(87)90201-1

26. Kuratowski K., Mostowski A. Set Theory. Amsterdam, North-Holland Publishing Company, 1967.

27. Engelking R. General Topology. Paristwowe Wydawnictwo Naukowe, Warszawa, 1977.

28. Bourbaki N. Topologie générale. Chapitre 1,2. Quatrième édition. Paris, Hermann, 1965. (in French)

29. Aleksandrov P.S. Vvedeniye v teoriyu mnoghestv i obshchuyu topologiyu [Introduction to the Sets Theory of and General Topology]. Moscow, URSS, 2004.

Received May 10, 2016

УДК 517.977 Б01: 10.14529/ттр160307

ЭЛЕМЕНТЫ ОПЕРАТОРНОЙ ВЫПУКЛОСТИ В КОНСТРУКЦИЯХ МЕТОДА ПРОГРАММНЫХ ИТЕРАЦИЙ

Д.А. Серков, А.Г. Ченцов

Рассматриваемая игровая задача удержания (в случае ограниченного промежутка управления) является частным случаем задачи сближения при наличии фазовых ограничений с гиперплоскостью отвечающей терминальному моменту времени (вместе с тем, задача удержания с бесконечным горизонтом также вкладывается предлагаемую постановку). Основным отличием от ранее рассмотренных постановок задачи является возможность вариации пространства траекторий системы и пространства реализаций неопределенных факторов в зависимости от начального момента управления. Показано, что множество начальных позиций, для которых задача не разрешима есть операторно-выпуклая оболочка пустого множества, построенная на основе опрерато-ра программного поглощения. При дополнительных условиях согласованности (пространств траекторий системы и реализаций помехи в различные моменты времени) показано, что множество успешной разрешимости задачи удержания определяется в виде предела итерационной процедуры на пространстве множеств, элементами которых являются позиции игры, а также установлена структура разрешающих квазистратегий.

Ключевые слова: программные итерации; операторная выпуклость; квазистратегии.

Работа проводилась при финансовой поддержке Российского фонда фундаментальных исследований (проекты № 16-01-0064-9, ßß 16-01-00505) и постановления

№211 Правительства Российской Федерации, контракт № 02.AOS.21.0006.

Литература

1. Красовский, H.H. Альтернатива для игровой задачи сближения / H.H. Красовский,

A.И. Субботин // Прикладная математика и механика. - 1970. - Т. 34, № 6. - С. 10051022.

2. Красовский, H.H. Позиционные дифференциальные игры / H.H. Красовский, А.И. Субботин. - М.: Наука, 1974. - 456 с.

3. Красовский, H.H. Игровые задачи о встрече движений / H.H. Красовский. - М.: Наука, 1970. - 420 с.

4. Кряжимский, A.B. К теории позиционных дифференциальных игр сближения-уклонения / A.B. Кряжимский // Доклады Академии наук СССР. - 1978. - Т. 239, № 4. - С. 779-782.

5. Красовский, H.H. Дифференциальная игра сближения-уклонения. I / H.H. Красовский // Известия Академии наук СССР: Техническая кибернетика. - 1973. - № 2. -С. 3-18.

6. Красовский, H.H. Дифференциальная игра сближения-уклонения. II / H.H. Красовский // Известия Академии наук СССР: Техническая кибернетика. - 1973. - № 3. -С. 22-42.

7. Ченцов, А.Г. О структуре одной игровой задачи сближения / А.Г. Ченцов // Доклады Академии наук СССР. - 1975. - Т. 224, № 6. - С. 1272-1275.

8. Ченцов, А.Г. Об игровой задаче сближения в заданный момент времени / А.Г. Ченцов // Математический сборник. - 1976. - Т. 99 (141), № 3. - С. 394-420.

9. Ченцов, А.Г. К игровой задаче наведения / А.Г. Ченцов // Доклады Академии наук СССР. - 1976. - Т. 226, № 1. - С. 73-76.

10. Ченцов, А.Г. К игровой задаче наведения с информационной памятью / А.Г. Ченцов // Доклады Академии наук СССР. - 1976. - Т. 227, № 2. - С. 306-309.

11. Чистяков, C.B. К решению игровых задач преследования / C.B. Чистяков // Прикладная математика и механика. - 1977. - Т. 41, № 5. - С. 825-832.

12. Ухоботов, В.И. Построение стабильного моста для одного класса линейных игр /

B.И. Ухоботов // Прикладная математика и механика. - 1977. - Т. 41, № 2. - С. 358-364.

13. Меликян, A.A. Цена игры в линейной дифференциальной игре сближения / A.A. Ме-ликян // Доклады Академии наук СССР. - 1977. - Т. 237, № 3. - С. 521-524.

14. Ченцов, А.Г. Метод программных итераций для дифференциальной игры сближения-уклонения: Рукопись депонирована в ВИНИТИ: 1933-79 Деп. / А.Г. Ченцов. - Свердловск: Уральский политехнический институт им. С.М. Кирова, 1979.

15. Ченцов, А.Г. Об альтернативе в классе квазистратегий для дифференциальной игры сближения-уклонения / А.Г. Ченцов // Дифференциальные уравнения. - 1980. - Т. 16, № 10. - С. 1801-1808.

16. Солтан, В.П. Введение в аксиоматическую теорию выпуклости / В.П. Солтан. - Кишинев: Штинница, 1984. - 224 с.

17. Ченцов, А.Г. О задаче управления с ограниченным числом переключений: депонированная рукопись: 4942-В 87 / А.Г. Ченцов. - Свердловск: Уральский политехнический институт им. С.М. Кирова, 1987.

18. Ченцов А.Г. Метод программных итераций для решения абстрактной задачи удержания / А.Г. Ченцов // Автоматика и телемеханика. - 2004. - № 2. - С. 157-169.

19. Ченцов, А.Г. К вопросу о соотношении различных версий метода программных итераций: позиционный вариант / А.Г. Ченцов // Кибернетика и системный анализ. - 2002.

- № 3. - С. 130-149.

20. Ченцов А.Г. К вопросу об итерационной реализации неупреждающих многозначных отображений / А.Г. Ченцов // Известия ВУЗов. Математика. - 2000. - № 3. - С. 66-76.

21. Ченцов А.Г. Неупреждающие многозначные отображения и их построение с помощью метода программных итераций. I / А.Г. Ченцов // Дифференциальные уравнения. -2001. - Т. 37, № 4. - С. 470-480.

22. Ченцов А.Г. Неупреждающие многозначные отображения и их построение с помощью метода программных итераций. II / А.Г. Ченцов // Дифференциальные уравнения. -2001. - Т. 37, № 5. - С. 679-688.

23. Серков, Д.А. Метод программных итераций и операторная выпуклость в абстрактной задаче удержания / Д.А. Серков, А.Г. Ченцов // Вестник Удмуртского университета. Серия 1: Математика. Механика. Компьютерные науки. - 2015. - Т. 25, № 3. - С. 348-366.

24. Ченцов, А.Г. Монотонные итерации множеств и их приложения к игровым задачам управления / А.Г. Ченцов, В.П. Дятлов // Кибернетика. - 1987. - № 2. - С. 92-99.

25. Иванов, В.М. Об управлении дискретными системами на бесконечном промежутке времени / В.М. Иванов, А.Г. Ченцов // Журнал вычислительной математики и математической физики. - 1987. - Т. 27, № 12. - С. 1780-1789.

26. Куратовский, К. Теория множеств / К. Куратовский, А. Мостовский. - М.: Мир, 1970.

- 416 с.

27. Энгелькинг, Р. Общая топология / Р. Энгелькинг. - М.: Мир, 1986. - 752 с.

28. Бурбаки, Н. Общая топология. Основные структуры / Н. Бурбаки. - М.: Наука, 1968. -275 с.

29. Александров, П.С. Введение в теорию множеств и общую топологию / П.С. Александров. - М.: Едиториал УРСС, 2004. - 367 с.

Дмитрий Александрович Серков, доктор физико-математических наук, ведущий научный сотрудник, Институт математики и механики им. H.H. Красовского УрО РАН; профессор, кафедра вычислительных методов и уравнений математической физики, Институт радиоэлектроники и информационных технологий, Уральский федеральный университет им. первого Президента России Б.Н. Е ЛЬЦИНс! (г. Екатеринбург, Российская Федерация), [email protected].

Александр Георгиевич Ченцов, доктор физико-математических наук, член-корреспондент РАН, главный научный сотрудник, Институт математики и механики им. H.H. Красовского УрО РАН; профессор, кафедра вычислительных методов и уравнений математической физики, Институт радиоэлектроники и информационных технологий, Уральский федеральный университет им. первого Президента России Б.Н. Ельцина (г. Екатеринбург, Российская Федерация), [email protected].

Поступила в редакцию 10 мая 2016 г.