Next Article in Journal
Using Value-Based Potentials for Making Approximate Inference on Probabilistic Graphical Models
Next Article in Special Issue
A Note on Some Weaker Notions of Cop-Win and Robber-Win Graphs
Previous Article in Journal
Modeling of Territorial and Managerial Aspects of Robotization of Agriculture in Russia
Previous Article in Special Issue
The Effect of Bounded Rationality on Human Cooperation with Voluntary Participation
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Differential Game for an Infinite System of Two-Block Differential Equations

by
Gafurjan Ibragimov
1,
Sarvinoz Kuchkarova
2,
Risman Mat Hasim
1 and
Bruno Antonio Pansera
3,*
1
Department of Mathematics, Universiti Putra Malaysia, Serdang 43400, Malaysia
2
National University of Uzbekistan, University Street, Almazar District, Tashkent 1000174, Uzbekistan
3
Department of Law and Economics and Human Sciences, University “Mediterranea” of Reggio Calabria, Via dell’Universitá, 25, 89124 Reggio Calabria, Italy
*
Author to whom correspondence should be addressed.
Submission received: 21 June 2022 / Revised: 14 July 2022 / Accepted: 19 July 2022 / Published: 21 July 2022
(This article belongs to the Special Issue Differential Games and Its Applications)

Abstract

:
We present a pursuit differential game for an infinite system of two-block differential equations in Hilbert space l 2 . The pursuer and evader control functions are subject to integral constraints. The differential game is said to be completed if the state of the system falls into the origin of l 2 at some finite time. The purpose of the pursuer is to bring the state of the controlled system to the origin of the space l 2 , whereas the evader’s aim is to prevent this. For the optimal pursuit time, we obtain an equation and construct the optimal strategies for the players.

1. Introduction

The concept of differential games was introduced by R. Isaacs [1], although some differential games were considered before Isaacs. The majority of the past literature on this subject is devoted to finite-space differential games (see, for example, [2,3,4,5]).
Control problems described by partial differential equations can be studied in some Banach spaces (see, for example, [6,7,8,9]).
In many cases, control problems governed by partial differential equations can be reduced to those written by an infinite system of differential equations, such as those in [6,8,10,11,12,13,14].
In the paper of Azamov et al. [15], for an infinite system of linear ordinary differential equations, the principle diagonal of the coefficient matrix is λ and the upper diagonal entries of the matrix are 1 s. The stability of λ 1 and the controllability of the system were studied. The exact controllability for the trajectories the Korteweg–de Vries–Burgers equation was studied through a linearized system in [13]. Furthermore, the work in [16] relates to a control problem for an infinite system of differential equations.
Differential games problems were studied for the first time in [8,17] in systems with distributed parameters.
The studies presented in [18,19,20,21,22,23,24,25,26] were devoted to differential games for infinite-dimensional spaces.
The study presented in [22] was devoted to the differential games described by the partial differential equation of the parabolic type given on some interval, [ 0 , T ] . The differential games were reduced to those described by the following infinite system of differential equations:
z ˙ i = λ i z i u i + v i , z i ( 0 ) = z i 0 , i = 1 , 2 , . . . , 0 > λ 1 λ 2 . . . ,
where u i , v i , i = 1 , 2 , are the control parameters of pursuer and evader, respectively. In that paper, four differential games corresponding to the following constraints on controls were considered and sufficient conditions of evasion and completion pursuit were obtained:
( i ) 0 T i = 1 u i 2 ( t ) d t ρ 2 , 0 T i = 1 v i 2 ( t ) d t σ 2 ( i i ) i = 1 u i 2 ( t ) ρ 2 , i = 1 v i 2 ( t ) σ 2 ( i i i ) 0 T i = 1 u i 2 ( t ) d t ρ 2 , i = 1 v i 2 ( t ) σ 2 ( i v ) i = 1 u i 2 ( t ) ρ 2 , 0 T i = 1 v i 2 ( t ) d t σ 2
A simple motion-evasion differential game of infinitely numerous evaders and pursuers was studied in [18] in the Hilbert space l 2 . The fact that l 2 is an infinite-dimensional space played a key role in the construction of the evasion strategy.
The soft-landing differential game problem of one pursuer and one evader described by the following infinite system of equations was studied in [19]:
x ¨ k = α k x k + β k y k u k 1 + v k 1 , x k ( 0 ) = x k 0 , x ˙ k ( 0 ) = x k 1 y ¨ k = β k x k + α k y k u k 2 + v k 2 , y k ( 0 ) = y k 0 , y ˙ k ( 0 ) = y k 1 , k = 1 , 2 , ,
In the case of integral constraints on the controls of players, a theorem on the completion of the game was proved.
The construction of optimal strategies of players is a difficult and important task in differential games (see, for example, [20,27]). The study presented in [27] is devoted to the construction of such strategies for the differential game governed by the following infinite system of differential equations:
x ˙ j = γ j x j δ j y j + u j 1 v j 1 , x j ( 0 ) = x j 0 , y ˙ j = δ j x j + γ j y j + u j 2 v j 2 , y j ( 0 ) = y j 0 ,
j = 1 , 2 , in Hilbert space l 2 , where γ j , δ j are given real numbers; γ j 0 , ξ 0 = ( ξ 10 , ξ 20 , ) = ( x 10 , y 10 , x 20 , y 20 , ) is the initial state with ξ j 0 = ( x j 0 , y j 0 ) ; u = ( u 11 , u 12 , u 21 , u 22 , ) is the pursuer’s control parameter; and v = ( v 11 , v 12 , v 21 , v 22 , ) is the evader’s control parameter. It is assumed that ξ 0 l 2 and ξ 0 0 .
The present paper studies a pursuit–evasion differential game of one pursuer and a single evader governed by an infinite system of two-block differential Equation (1) under the condition of γ j 0 . The control functions of both the pursuer and evader are subjected to integral constraints. The pursuer’s purpose is to bring the state of system (1) to the origin of the space l 2 , the evader’s purpose is to avoid this. We find the optimal pursuit time, and construct optimal strategies of pursuer and evader. First, for an auxiliary control problem, the optimal time is found and the optimal control is constructed. Then, an equation for the optimal pursuit time is given and the optimal strategies of the players are constructed.

2. Statement of the Problem

Let ρ 0 be a given positive number.
Definition 1.
We call the function w ( t ) = ( w 11 ( t ) , w 12 ( t ) , w 21 ( t ) , w 22 ( t ) , ) , 0 t T , with the values in l 2 an admissible control if its coordinates, w j 1 ( t ) , w j 2 ( t ) , 0 t T , j = 1 , 2 , , are measurable and satisfy the following condition:
0 T | | w ( s ) | | 2 d s ρ 0 2 , | | w ( s ) | | = j = 1 w j 1 2 ( s ) + w j 2 2 ( s ) 1 / 2 ,
where T is a sufficiently large fixed positive number.
We use S ( ρ 0 ) to denote the set of all admissible controls. Let
C j ( t ) = e γ j t cos δ j t sin δ j t sin δ j t cos δ j t , j = 1 , 2 , .
It can be easily seen that, for the matrices C j ( t ) ,
C j ( t + h ) = C j ( t ) C j ( h ) = C j ( h ) C j ( t ) , | C j ( t ) ξ j | = | C j * ( t ) ξ j | = e γ j t | ξ j | ,
where C * denotes the transpose of the matrix C. Let
ξ j ( t ) = ( x j ( t ) , y j ( t ) ) , ξ ( t ) = ( ξ 1 ( t ) , ξ 2 ( t ) , ) = ( x 1 ( t ) , y 1 ( t ) , x 2 ( t ) , y 2 ( t ) , ) , | ξ j | = x j 2 + y j 2 , ξ = j = 1 ( x j 2 + y j 2 ) 1 / 2 , ξ 0 = j = 1 ( x j 0 2 + y j 0 2 ) 1 / 2 .
We will use the symbol C ( 0 , T ; l 2 ) to denote the space of continuous functions ξ ( t ) l 2 , 0 t T . The following statement will be needed.
Proposition 1 ([28]).
If w ( · ) S ( ρ 0 ) and 0 γ j a for some a > 0 , then, for any given T > 0 , the following infinite system of two-block differential equations
x ˙ j = γ j x j δ j y j + w j 1 , x j ( 0 ) = x j 0 y ˙ j = δ j x j + γ j y j + w j 2 , y j ( 0 ) = y j 0 , j = 1 , 2 , ,
has a unique solution ξ ( t ) = ( ξ 1 ( t ) , ξ 2 ( t ) , ) , 0 t T , in the space C ( 0 , T ; l 2 ) , where
ξ j ( t ) = C j ( t ) ξ j 0 + 0 t C j ( t s ) w ( s ) d s , j = 1 , 2 , .
From now on, we consider the solution of system (4) on the finite time interval [ 0 , T ] since Proposition 1 was proved [28] for any fixed T > 0 . Therefore, T is assumed to be sufficiently large number.
Definition 2.
A function u ( · ) S ( ρ ) and v ( · ) S ( σ ) , where ρ and σ are given positive numbers, are referred to as the admissible controls of pursuer and evader, respectively.
Let w j = ( w j 1 , w j 2 ) , u j = ( u j 1 , u j 2 ) , v j = ( v j 1 , v j 2 ) , j = 1 , 2 , . We give the definition for the strategy of pursuer.
Definition 3.
A function
u ( t , v ) = ( u 1 ( t , v ) , u 2 ( t , v ) , ) , u : [ 0 , T ] × l 2 l 2 ,
of the form
u j ( t , v ) = v j ( t ) + w j ( t ) , w ( · ) = ( w 1 ( · ) , w 2 ( · ) , ) S ( ρ σ ) ,
subject to the integral constraint
j = 1 0 T | u j ( t , v ( t ) ) | 2 d t ρ 2 f o r a n y v ( · ) S ( σ ) ,
is called a strategy of the pursuer.
Definition 4.
If, for any admissible control of evader, the equality ξ ( τ ) = 0 holds at some time τ [ 0 , θ ] depending on the admissible control of evader, we state that the strategy u ( · ) guarantees the completion of pursuit for the time θ. Here, the number θ is called a guaranteed pursuit time.
Let
μ ( t ) = ρ 2 0 t u ( s ) 2 d s 1 / 2 , ν ( t ) = σ 2 0 t v ( s ) 2 d s 1 / 2 .
Definition 5.
A function
v ( t , ξ , μ , ν , u ( t ε ) ) , v : [ 0 , T ] × l 2 × [ 0 , ρ 0 ] × [ 0 , σ 0 ] × l 2 l 2 ,
of the form
v ( t , ξ , μ , ν , u ( t ε ) ) = v 0 ( t ) , μ ( t ) > ν ( t ) , 0 , τ t τ + ε , u ( t ε ) , τ + ε < t T ,
that satisfies the constraint
j = 1 0 T | v j ( t , ξ , μ , ν , u ( t ε ) ) | 2 d t σ 2 ,
is called a strategy of the evader, where ε is a positive number which will be chosen during the game, and τ is the first time when μ ( τ ) = ν ( τ ) .
Next, we give a definition for the optimal pursuit time and optimal strategies of players.
Definition 6.
A number θ is called the optimal pursuit time if the following conditions are met:
(i)
There exists a strategy u 0 ( · ) of the pursuer of pursuer such that, for any admissible control of the evader, the differential game can be completed on the time interval [ 0 , θ ] ;
(ii)
There exists a strategy v 0 ( · ) of the evader, for which ξ ( t ) 0 , 0 t < θ , for an arbitrary admissible control of the pursuer.
In this case, we say that evasion is possible on [ 0 , θ ) . Furthermore, the strategies u 0 ( · ) and v 0 ( · ) are called optimal strategies of the pursuer and evader, respectively.
The main problem of the paper is to find the optimal pursuit time and to construct the optimal strategies of pursuer and evader in the differential game (1).

3. Time-Optimal Control Problem

First, we consider the following time-optimal control problem for the system (4).
Problem 1.
Find the optimal time to transfer the state of the system (4) from the given initial state ξ ( 0 ) = ξ 0 to the origin of l 2 .
To solve this problem, we let
ϕ j ( t ) = 0 t e 2 γ j t d t = 1 e 2 γ j t 2 γ j , γ j 0 , t , γ j = 0 .
Observe 1 ϕ j ( t ) + as t 0 + for each j = 1 , 2 , . Since ξ 0 0 , at least one term of the sum in the left-hand side of the equation
j = 1 | ξ j 0 | 2 ϕ j ( t ) = ρ 0 2 ,
which corresponds to the non-zero ξ j 0 , approaches + as t 0 + . Consequently, the left-hand side of Equation (6) approaches + as t 0 + . Moreover, the left part of (6) is decreasing function of t, t > 0 , because the functions ϕ j ( t ) are increasing. Since, for γ j > 0 ,
0 < 1 ϕ j ( t ) 2 γ j = 2 γ j 1 e 2 γ j t 2 γ j = 2 γ j e 2 γ j t 1 e 2 γ j t = 2 γ j e 2 γ j t 1 2 γ j 2 γ j t + 1 1 = 1 t ,
then
j = 1 2 γ j | ξ j 0 | 2 j = 1 | ξ j 0 | 2 ϕ j ( t ) = γ j = 0 | ξ j 0 | 2 t + γ j > 0 | ξ j 0 | 2 ϕ j ( t ) γ j = 0 | ξ j 0 | 2 t + γ j > 0 2 γ j + 1 t | ξ j 0 | 2 = j = 1 2 γ j | ξ j 0 | 2 + | | ξ 0 | | 2 t .
Consequently,
lim t j = 1 | ξ j 0 | 2 ϕ j ( t ) = j = 1 2 γ j | ξ j 0 | 2 ,
where the series on the right-hand side is convergent since γ j a and ξ 0 l 2 ; therefore,
j = 1 2 γ j | ξ j 0 | 2 j = 1 2 a | ξ j 0 | 2 = 2 a | | ξ 0 | | 2 .
Thus, if
j = 1 2 γ j | ξ j 0 | 2 < ρ 0 2 ,
then Equation (6) has a unique root t = θ .
We use the following statement to prove the main results of the present paper.
Lemma 1 ([29]).
Let C ( t ) , 0 t τ , be a continuous-matrix function of the order n, and its determinant be not identical to 0 on [ 0 , τ ] . Then, among the measurable functions, ω ( · ) , ω : [ 0 , τ ] R n , satisfying the condition
0 τ C ( s ) ω ( s ) d s = ξ 0
the control defined at almost everywhere on [ 0 , τ ] by the formula
ω ( s ) = C * ( s ) W 1 ( τ ) ξ 0 , W ( τ ) = 0 τ C ( s ) C * ( s ) d s ,
gives the minimum to the functional 0 τ | ω ( s ) | 2 d s .
Theorem 1.
If ξ 0 satisfies Equation (7), then the number θ, the unique root of Equation (6), is the optimal time for the time-optimal control problem.
Proof. 
Since
ξ j ( θ ) = C j ( θ ) η j ( θ ) , η j ( θ ) = ξ j 0 + 0 θ C j ( s ) w j ( s ) d s j = 1 , 2 , ,
to show that ξ ( θ ) = 0 , we need only to show that η j ( θ ) = 0 for all j = 1 , 2 , , that is,
0 θ C j ( s ) w j ( s ) d s = ξ j 0 , j = 1 , 2 , ,
To apply Lemma 1 to this equation, we let
W j ( θ ) = 0 θ C j ( s ) C j * ( s ) d s ,
where E 2 is the 2 × 2 identity matrix. It can be easily shown that W j ( θ ) = ϕ j ( θ ) E 2 and W j 1 ( θ ) = 1 ϕ j ( θ ) E 2 . Using Formula (8), we define the control w ( t ) = ( w 1 ( t ) , w 2 ( t ) , ) , 0 t θ , by the equation
w j ( t ) = C j * ( t ) W j 1 ( θ ) ( ξ 0 ) = 1 ϕ j ( θ ) C j * ( t ) ξ j 0 , j = 1 , 2 , . . . , 0 t θ .
Then, by (3)
j = 1 0 θ | w j ( t ) | 2 d t = j = 1 1 ϕ j 2 ( θ ) 0 θ | C j * ( t ) ξ j 0 | 2 d t = j = 1 | ξ j 0 | 2 ϕ j 2 ( θ ) 0 θ e 2 γ j t d t = j = 1 | ξ j 0 | 2 ϕ j ( θ ) = ρ 0 2 .
Hence, the control (9) is admissible.
Next, we show that ξ j ( θ ) = 0 , j = 1 , 2 , . Indeed,
η j ( θ ) = ξ j 0 + 0 θ C j ( s ) w j ( s ) d s = ξ j 0 1 ϕ j ( θ ) 0 θ C j ( s ) C j * ( s ) ξ j 0 d s = ξ j 0 1 ϕ j ( θ ) 0 θ e 2 γ j s ξ j 0 d s = ξ j 0 ξ j 0 = 0 , j = 1 , 2 , .
Hence, ξ j ( θ ) = 0 , j = 1 , 2 , .
What is left is to show is that ξ ( t ) 0 , 0 t < θ , where ξ ( t ) is the state of the system (4). To obtain a contradiction, we assume that there exists time τ , 0 < τ < θ , and an admissible control w ¯ ( · ) = ( w ¯ 1 ( · ) , w ¯ 2 ( · ) , ) , such that ξ ( τ ) = 0 . Consequently, η ( τ ) = ( η 1 ( τ ) , η 2 ( τ ) , ) = 0 , i.e.,
0 τ C j ( s ) w ¯ j ( s ) d s = ξ j 0 , 0 τ | | w ¯ ( s ) | | 2 d s ρ 0 2 .
Then, by Lemma 1 for the control
w 0 ( t ) = ( w 10 ( t ) , w 20 ( t ) , ) , w j 0 ( t ) = 1 ϕ j ( τ ) C j * ( t ) ξ j 0 , j = 1 , 2 , ,
(10) is satisfied and the functional
I ( w ( · ) ) = j = 1 0 τ | w j ( t ) | 2 d t
takes its minimum. Substituting the control (11) into the functional I yields
I ( w ¯ ( · ) ) I ( w 0 ( · ) ) = j = 1 | ξ j 0 | 2 ϕ j ( τ ) > j = 1 | ξ j 0 | 2 ϕ j ( θ ) = ρ 0 2
This means the control w ¯ ( · ) is not admissible—this is a contradiction. This completes the Proof of Theorem 1.  ☐

4. Differential Game Problem

Now, we examine the differential game (1). From the reasoning of the previous section, we conclude that the equation
j = 1 | ξ j 0 | 2 ϕ j ( t ) = ( ρ σ ) 2
has the only solution t = θ 1 . Since T is sufficiently large number, we assume that θ 1 < T .
Theorem 2.
The number θ 1 is the optimal pursuit time in the game (1).
Proof. 
First, we establish that the time θ 1 is a guaranteed pursuit time in a differential game (1). To establish this, we let the pursuer use the following strategy
u j ( t , v ) = v j ( t ) 1 ϕ j ( θ 1 ) C * ( t ) ξ j 0 , j = 1 , 2 , ,
where v ( t ) , 0 t θ 1 , is an arbitrary admissible control of the evader. To see that the strategy (12) is admissible, we use the definition of the time θ 1 and apply the Minkowski inequality
j = 1 a b ( f j ( t ) + g j ( t ) ) 2 d t 1 / 2 j = 1 a b f j 2 ( t ) d t 1 / 2 + j = 1 a b g j 2 ( t ) d t 1 / 2
where a b , and f j ( t ) , g j ( t ) , i = 1 , 2 , , t [ a , b ] , are scalar measurable functions, to obtain
j = 1 0 θ 1 | u j ( t , v ( t ) ) | 2 d t 1 / 2 = j = 1 0 θ 1 | v j ( t ) 1 ϕ j ( θ 1 ) C * ( t ) ξ j 0 | 2 d t 1 / 2 j = 1 0 θ 1 | v j ( t ) | 2 d t 1 / 2 + j = 1 0 θ 1 1 ϕ j 2 ( θ 1 ) | C * ( t ) ξ j 0 | 2 d t 1 / 2 σ + j = 1 | ξ j 0 | 2 ϕ j ( θ 1 ) 1 / 2 σ + ρ σ = ρ .
It is straightforward to show that ξ j ( θ 1 ) = 0 , j = 1 , 2 , . Thus, θ 1 is a guaranteed pursuit time.
We next claim that evasion is possible on [ 0 , θ 1 ) . We divide the construction of evader’s strategy into two parts. If μ ( t ) > ν ( t ) , we set
v j ( t ) = 1 ϕ j ( θ 1 ) · σ ρ σ C j * ( t ) ξ j 0 , j = 1 , 2 , .
If μ ( τ ) = ν ( τ ) at some τ [ 0 , θ 1 ) , then starting from the time τ , the evader applies the second part of its strategy to be constructed later.
We let the evader use the control (13). We claim that ξ ( t ) 0 , t [ 0 , θ 1 ) , while μ ( t ) ν ( t ) .
On the contrary, suppose that the game is completed at some t = θ 0 < θ 1 , that is,
ξ j ( θ 0 ) = C j ( θ 0 ) η j ( θ 0 ) = 0 , j = 1 , 2 , ,
hence
η j ( θ 0 ) = ξ j 0 0 θ 0 C j ( s ) u j ( s ) d s + 0 θ 0 C j ( s ) v j ( s ) d s = 0 , j = 1 , 2 , ,
when
μ ( θ 0 ) ν ( θ 0 ) .
We have from (13) that
0 θ 0 C j ( s ) u j ( s ) d s = ξ j 0 + 0 θ 0 C j ( s ) v j ( s ) d s = ξ j 0 + σ ρ σ ϕ j ( θ 0 ) ϕ j ( θ 1 ) ξ j 0 , j = 1 , 2 , .
For this equation, applying Lemma 1, we obtain the minimum of the functional 0 θ 0 | u j ( s ) | 2 d s at
u j ( s ) = 1 ϕ j ( θ 0 ) C j * ( s ) ξ j 0 1 + σ ρ σ ϕ j ( θ 0 ) ϕ j ( θ 1 )
almost everywhere on [ 0 , θ 0 ] . Therefore,
0 θ 0 | u j ( s ) | 2 d s = 1 ϕ j ( θ 0 ) | ξ j 0 | 2 1 + σ ρ σ ϕ j ( θ 0 ) ϕ j ( θ 1 ) 2 , j = 1 , 2 , .
By (13)
0 θ 0 | v j ( s ) | 2 d s = σ 2 ( ρ σ ) 2 ϕ j ( ρ ) ϕ j 2 ( θ 1 ) | ξ j 0 | 2 , j = 1 , 2 , .
This gives, for j = 1 , 2 , , that
0 θ 0 | u j ( s ) | 2 d s 0 θ 0 | v j ( s ) | 2 d s = 1 ϕ j ( θ 0 ) | ξ j 0 | 2 + 2 σ ρ σ 1 ϕ j ( θ 1 ) | ξ j 0 | 2 .
Consequently,
j = 1 0 θ 0 | u j ( s ) | 2 d s 0 θ 0 | v j ( s ) | 2 d s = j = 1 1 ϕ j ( θ 0 ) | ξ j 0 | 2 + 2 σ ρ σ j = 1 1 ϕ j ( θ 1 ) | ξ j 0 | 2
Since θ 0 < θ 1 and ϕ j ( t ) , t > 0 , is an increasing function, therefore in by the definition of θ 1 we obtain
j = 1 1 ϕ j ( θ 0 ) | ξ j 0 | 2 > j = 1 1 ϕ j ( θ 1 ) | ξ j 0 | 2 = ( ρ σ ) 2 .
Hence, by (15)
j = 1 0 θ 0 | u j ( s ) | 2 d s 0 θ 0 | v j ( s ) | 2 d s > ( ρ σ ) 2 + 2 σ ρ σ · ( ρ σ ) 2 = ρ 2 σ 2 ,
or, equivalently,
σ 2 j = 1 0 θ 0 | v j ( s ) | 2 d s > ρ 2 j = 1 0 θ 0 | u j ( s ) | 2 d s .
This gives ν 2 ( θ 0 ) > μ 2 ( θ 0 ) , contrary to our assumption μ ( θ 0 ) ν ( θ 0 ) . Thus, when the evader uses control (13), we have ξ ( t ) 0 , t [ 0 , θ 1 ) whenever μ ( t ) ν ( t ) .
What if μ ( t 1 ) < ν ( t 1 ) at some time t 1 [ 0 , θ 1 ) ? If so, using the continuity of the functions μ ( t ) , ν ( t ) , t 0 , and the relation μ ( 0 ) > ν ( 0 ) (that is, ρ > σ ), we deduce that there exists τ , 0 τ < t 1 , such that μ ( τ ) = ν ( τ ) . In view of the inequality ξ ( t ) 0 , 0 t τ , proved above, we have ξ ( τ ) 0 .
Starting from the time τ the evader applies the second part of their strategy to be constructed below. Note that the inequality ξ ( τ ) = ( ξ 1 ( τ ) , ξ 2 ( τ ) , ) 0 , implies that ξ j ( τ ) = C j ( τ ) η j ( τ ) 0 for some j. Hence, η j ( τ ) 0 . Consider the following equation:
η j ( t ) = η j ( τ ) τ t C j ( s ) ( u j ( s ) v j ( s ) ) d s , t τ ,
corresponding to the number j. We suggest the following strategy
v j ( s ) = 0 , τ s τ + ε , u j ( s ε ) , τ + ε < s T ,
for the evader, where ε is a positive number which will be chosen below, and show that ξ j ( t ) 0 , τ t T . If τ t τ + ε , then
η j ( t ) = η j ( τ ) τ t C j ( s ) u j ( s ) d s
and
| η j ( t ) | | η j ( τ ) | τ t C j ( s ) u j ( s ) d s | η j ( τ ) | τ t | C j ( s ) u j ( s ) | d s = | η j ( τ ) | τ t e γ j s | u j ( s ) | d s | η j ( τ ) | τ τ + ε e 2 γ j s d s · τ τ + ε | u j ( s ) | 2 d s 1 / 2 .
The right-hand side of the last inequality approaches | η j ( τ ) | as ε 0 since
τ τ + ε | u j ( s ) | 2 d s 0 T | u j ( s ) | 2 d s ρ 2 .
If τ + ε < t T , then we have
η j ( t ) = η j ( τ ) τ t C j ( s ) u j ( s ) d s + τ + ε t C j ( s ) u j ( s ε ) d s = η j ( τ ) τ t C j ( s ) u j ( s ) d s + τ t ε C j ( s ε ) u j ( s ) d s = η j ( τ ) + τ t ε [ C j ( s ε ) C j ( s ) ] u j ( s ) d s + t ε t C j ( s ) u j ( s ) d s .
We use the Cauchy–Schwartz inequality to obtain
| η j ( t ) | | η j ( τ ) | a j · τ t ε | u j ( s ) | 2 d s 1 / 2 t ε t e 2 γ j s d s · t ε t | u j ( s ) | 2 d s 1 / 2 ,
where a j = τ t ε C j ( s ε ) C j ( s ) 2 d s 1 / 2 0 as ε 0 since C j ( s ε ) C j ( s ) 0 , s [ 0 , T ] , as ε 0 . Clearly, | η j ( τ ) | > 0 , and the second and the third summands on the right-hand side tends to 0 as ε 0 .
Consequently, for some ε 0 > 0 , we have η j ( t ) > | η j ( τ ) | / 2 , t τ , whenever 0 < ε < ε 0 . This clearly ensures that η j ( t ) 0 for all t τ . Therefore, ξ j ( t ) 0 , τ t T . Hence, ξ ( t ) 0 , τ t T . The proof of the theorem is complete.  ☐

5. Conclusions

We have studied a pursuit differential game for an infinite system of two-block differential equations in the Hilbert space l 2 . We found an equation for the optimal transfer time for an auxiliary optimal control problem, which is of independent importance. Furthermore, we have constructed the corresponding optimal control for this problem. For the differential game, we obtained a formula for the optimal pursuit time and constructed optimal strategies of players.

Author Contributions

Investigation, G.I., S.K., R.M.H. and B.A.P.; methodology, G.I., S.K., R.M.H. and B.A.P.; project administration, S.K. and R.M.H.; validation, G.I., S.K., R.M.H. and B.A.P.; visualization, G.I.; writing—original draft preparation, G.I., S.K., R.M.H. and B.A.P.; writing—review and editing, G.I., S.K., R.M.H. and B.A.P. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Acknowledgments

The authors thank the anonymous reviewers for their careful reading of our manuscript and their many insightful comments and suggestions.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Isaacs, R. Differential Games; John Wiley & Sons: New York, NY, USA, 1965. [Google Scholar]
  2. Berkovitz, L.D. A Survey of Differential Games. In Mathematical Theory of Control; Academic Press: New York, NY, USA, 1967; pp. 373–385. [Google Scholar]
  3. Chikrii, A.A. Conflict-Controlled Processes; Kluwer: Dordrecht, The Netherlands, 1997. [Google Scholar]
  4. Petrosyan, L.A. Differential Games of Pursuit; World Scientific: Singapore, 1993. [Google Scholar]
  5. Pontryagin, L.S. Selected Works; Nauka: Moscow, Russia, 1988. [Google Scholar]
  6. Avdonin, S.A.; Ivanov, S.A. Families of Exponentials: The Method of Moments in Controllability Problems for Distributed Parameter Systems; Cambridge University Press: Cambridge, UK, 1995. [Google Scholar]
  7. Chaves-Silva, F.; Zhang, X.; Zuazua, E. Controllability of evolution equations with memory. SIAM J. Control Optim. 2017, 55, 2437–2459. [Google Scholar] [CrossRef] [Green Version]
  8. Lions, J.L. Contrôle Optimal de Systémes Gouvernées par des Equations aux Dérivées Partielles; Dunod: Paris, France, 1968. [Google Scholar]
  9. Martin, P.; Rosier, L.; Rouchon, P. Null controllability of the structurally damped wave equation with moving control. SIAM J. Control Optim. 2013, 51, 660–684. [Google Scholar] [CrossRef] [Green Version]
  10. Albeverio, S.; Alimov, S.A. On a time-optimal control problem associated with the heat exchange process. Appl. Math. Optim. 2008, 57, 58–68. [Google Scholar] [CrossRef]
  11. Butkovskiy, A.G. Theory of Optimal Control of Distributed Parameter Systems; Elsevier: New York, NY, USA, 1969. [Google Scholar]
  12. Chernous’ko, F.L. Bounded controls in distributed-parameter systems. J. Appl. Math. Mech. 1992, 56, 707–723. [Google Scholar] [CrossRef]
  13. Eduardo, C.; Montoya, C.; Zhang, B. Local exact controllability to the trajectories of the Korteweg-de Vries-Burgers equation on a bounded domain with mixed boundary conditions. J. Differ. Equ. 2020, 268.9, 4945–4972. [Google Scholar]
  14. Fattorini, H.O. Time-Optimal control of solutions of operational differential equations. SIAM J. Control 1964, 2, 54–59. [Google Scholar]
  15. Azamov, A.A.; Ibragimov, G.I.; Mamayusupov, K.; Ruzibaev, M. On the stability and null controllability of an infinite system of linear differential equations. J. Dyn. Control Syst. 2021, 1–11. [Google Scholar] [CrossRef]
  16. Azamov, A.A.; Ruziboev, M.B. The time-optimal problem for evolutionary partial differential equations. J. Appl. Math. Mech. 2013, 77, 220–224. [Google Scholar] [CrossRef]
  17. Osipov, Y.S. The theory of differential games in systems with distributed parameters. Dokl. Akad. Nauk SSSR 1975, 223, 1314–1317. [Google Scholar]
  18. Alias, I.A.; Ibragimov, G.I.; Rakhmanov, A.T. Evasion Differential Game of Infinitely Many Evaders from Infinitely Many Pursuers in Hilbert Space. Dyn. Games Appl. 2017, 7, 347–359. [Google Scholar] [CrossRef]
  19. Ibragimov, G.I.; Allahabi, F.; Kuchkarov, A.S. A pursuit problem in an infinite system of second-order differential equations. Ukr. Math. J. 2014, 65, 1203–1216. [Google Scholar] [CrossRef]
  20. Ibragimov, G.I. The optimal pursuit problem reduced to an infinite system of differential equation. J. Appl. Math. Mech. 2013, 77, 470–476. [Google Scholar] [CrossRef]
  21. Satimov, N.Y.; Tukhtasinov, M. Game problems on a fixed interval in controlled first-order evolution equations. Math. Notes 2006, 80, 578–589. [Google Scholar] [CrossRef]
  22. Satimov, N.Y.; Tukhtasinov, M. On Some Game Problems for First-Order Controlled Evolution Equations. Differ. Equ. 2005, 41, 1169–1177. [Google Scholar] [CrossRef]
  23. Tukhtasinov, M.; Ibragimov, G.I.; Kuchkarova, S.A.; Hasim, R.M. Differential games for an infinite 2-systems of differential equations. Mathematics 2021, 9, 1467. [Google Scholar] [CrossRef]
  24. Satimov, N.Y.; Tukhtasinov, M. On Game Problems for Second-Order Evolution Equations. Russ. Math. 2007, 51, 49–57. [Google Scholar] [CrossRef]
  25. Tukhtasinov, M. Some problems in the theory of differential pursuit games in systems with distributed parameters. J. Appl. Math. Mech. 1995, 59, 979–984. [Google Scholar] [CrossRef]
  26. Tukhtasinov, M.; Mamatov, M.S. On Pursuit Problems in Controlled Distributed Parameters Systems. Math. Notes 2008, 84, 256–262. [Google Scholar] [CrossRef]
  27. Ibragimov, G.I. Optimal pursuit time for a differential game in the Hilbert space l2. ScienceAsia 2013, 39S, 25–30. [Google Scholar] [CrossRef] [Green Version]
  28. Ibragimov, G.I.; Kuchkarova, S. Existence and uniqueness of solutions of an infinite system of 2-block of differential equations. Bull. Inst. Math. 2021, 4, 70–75. [Google Scholar]
  29. Lee, E.B.; Markus, L. Foundations of Optimal Control Theory; Wiley: New York, NY, USA, 1967. [Google Scholar]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Ibragimov, G.; Kuchkarova, S.; Hasim, R.M.; Pansera, B.A. Differential Game for an Infinite System of Two-Block Differential Equations. Mathematics 2022, 10, 2541. https://0-doi-org.brum.beds.ac.uk/10.3390/math10142541

AMA Style

Ibragimov G, Kuchkarova S, Hasim RM, Pansera BA. Differential Game for an Infinite System of Two-Block Differential Equations. Mathematics. 2022; 10(14):2541. https://0-doi-org.brum.beds.ac.uk/10.3390/math10142541

Chicago/Turabian Style

Ibragimov, Gafurjan, Sarvinoz Kuchkarova, Risman Mat Hasim, and Bruno Antonio Pansera. 2022. "Differential Game for an Infinite System of Two-Block Differential Equations" Mathematics 10, no. 14: 2541. https://0-doi-org.brum.beds.ac.uk/10.3390/math10142541

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop