Next Article in Journal
Diffusion Simulation on Mammograms: A Technique for Analyzing and Monitoring Breast Tumors
Previous Article in Journal
Revocable-Attribute-Based Encryption with En-DKER from Lattices
Previous Article in Special Issue
On the Lifeline Game of the Inertial Players with Integral and Geometric Constraints
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

On a Linear Differential Game in the Hilbert Space 2

by
Marks Ruziboev
1,2,†,
Gafurjan Ibragimov
3,4,†,
Khudoyor Mamayusupov
5,†,
Adkham Khaitmetov
6,† and
Bruno Antonio Pansera
7,*,†
1
School of Engineering, Central Asian University, Milliy Bog St 264, Tashkent 111221, Uzbekistan
2
Faculty of Mathematics, University of Vienna, Oskar-Morgenstern Platz 1, 1090 Vienna, Austria
3
V.I.Romanovskiy Institute of Mathematics, Uzbekistan Academy of Sciences, Tashkent 100174, Uzbekistan
4
Department of Applied Mathematics, Tashkent State University of Economics, Tashkent 100006, Uzbekistan
5
Department of Mathematics, New Uzbekistan University, Mustaqillik ave.54, Tashkent 100007, Uzbekistan
6
Department of Mathematics and Information Technologies, Fiscal Institute under the Tax Committee, Tashkent 100173, Uzbekistan
7
Department of Law, Economics and Human Sciences, University Mediterranea of Reggio Calabria, 89124 Reggio Calabria, Italy
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Submission received: 17 October 2023 / Revised: 1 December 2023 / Accepted: 14 December 2023 / Published: 17 December 2023
(This article belongs to the Special Issue Differential Games and Its Applications, 2nd Edition)

Abstract

:
Two player pursuit evasion differential game and time optimal zero control problem in 2 are considered. Optimal control for the corresponding zero control problem is found. A strategy for the pursuer that guarantees the solution for the pursuit problem is constructed.
MSC:
49N05; 49N75; 91A23; 91A24; 93C15

1. Introduction and Statement of the Problem

For every i N , d i × d i matrices Ai are given with 2 d i d , where d 2 is a fixed integer. We consider a differential game described by the following countable system of differential equations
x ˙ i = A i x i + u i v i , x i ( 0 ) = x i 0 R d i , i = 1 , 2 , ,
where u i is a control parameter of the pursuer, v i is a control parameter of the evader, both assumed to be locally integrable functions with values in R d i for all i N satisfying certain constraints (see Definition 2). For convenience, we form column vector x = ( x 1 * , x 2 * , ) * , where x i * is the transpose of x i R d i , for i = 1 , 2 , (Actually, we are just concatenating vectors x 1 , x 2 , … one below another to obtain an infinite vector. Below we adopt this point of view, which simplifies the notation considerably). Assume that x 0 = ( x 10 , x 20 , , ) 2 , i.e., x 2 = i = 0 x i 0 2 < + , where x i 0 is the Euclidean norm of x i 0 R d i . Let A = diag ( A 1 , A 2 , ) be an operator on R whose action is defined as A x = diag ( [ A 1 x 1 ] * , [ A 2 x 2 ] * , ) for x R . We would like to define e t A for suitable classes of matrices A i . The problem here is that A is not necessarily defined on 2 or even on (i.e., A x is not necessarily in for x since | A i x i | may go to infinity as n ). Therefore, we have to justify the existence of solutions to the above Cauchy problem for initial points in 2 .
We consider a pursuit-evasion differential game which consists of two separate problems as usual. The pursuit game can be completed in time T > 0 provided there exists a control function of the pursuer u : R 2 such that for any control of v : R 2 the solution of x : R 2 of (2) for any x 0 satisfies x ( T ) = 0 . In this case, T is called the guaranteed pursuit time. Below we state precise conditions that are imposed on u, v.
Motivation for the setup comes from control problems for evolutionary PDEs, where using suitable decomposition of the control problem (see, for example, [1,2,3,4,5]) x i would be a Fourier coefficient of an unknown function, while u i and v i would be that of control parameters. Also, the setup is of independent interest as a controlled system in a Banach space (for works in this spirit see for example [6,7,8,9,10,11,12,13]). Differential games for infinite dimensional systems are also well studied, for example, when the evolution of the system is governed by parabolic equations pursuit-evasion problems are considered in [14,15,16], where the problem for the partial differential equations is reduced to an infinite system of ordinary differential equations. Pursuit and evasion games with many players considered in [17,18,19,20].
For us, the system (1) is a toy model of a system consisting of countably many point masses moving in R n with simple motions which are not interacting with each other. It is the first step in understanding the system of weakly interacting controllable particles in a more natural setting, e.g., for considering control problems for systems considered in [21].

2. Main Results

As we pointed out earlier, we have to justify the existence of solutions of the following Cauchy problem
x ˙ i = A i x i + w i , x i ( 0 ) = x i 0 R d i , i = 1 , 2 , ,
with w i : R R d i locally integrable. We look for solutions of (2) from the space of continuous functions C ( [ 0 , T ] ; 2 ) for some T > 0 , such that the coordinates x i ( · ) of x : [ 0 , T ] 2 are almost everywhere differentiable.
Definition 1. 
We say that a family of matrices { A i } i N is uniformly normalizable if there exists a family { P i } i N of non-singular matrices and a constant C 1 such that P i · P i 1 C and P i A i P i 1 is a matrix in the Jordan normal form for all i N .
Notice that there exist uniformly normalizable families of matrices, i.e., if all elements are already in Jordan’s normal form, then we may take P i = Id for all i N . On the other hand, one can construct families, which aren’t uniformly normalizable. In this work we will assume that the family of matrices in (2) and (1) are uniformly normalizable and control parameters of the players satisfy the following constraint.
Definition 2. 
Fix θ > 0 and let B ( θ ) be the set of all functions w ( · ) = w 1 ( · ) , w 2 ( · ) , , w : [ 0 , T ] 2 , with measurable coordinates w i ( · ) R d i , 0 t T , i = 1 , 2 , , that satisfy the constraint
i = 1 0 T w i ( s ) 2 d s θ 2 .
B ( θ ) is called the set of admissible control functions.
We have the following
Theorem 1. 
Let { A i } be a family of uniformly normalizable matrices. If the real parts of eigenvalues of matrices A 1 , A 2 , . . are negative, then for any w B ( θ ) , θ > 0 system (2) has a unique solution for any z 0 2 . Moreover, the corresponding components of the solution x ( t ) = ( x 1 ( t ) , x 2 ( t ) , ) are given by
x i ( t ) = e t A i x i 0 + 0 t e ( t s ) A i w i ( s ) d s , i N .
Definition 3. 
System (2) is called globally asymptotically stable if lim t + x ( t ) = 0 for a solution x ( t ) of (2) with any initial condition x 0 2 and w i 0 for all i N . Further, system (2) is null-controllable from x 0 2 if there exists an admissible control u B ( θ ) and T = T ( u ) R + such that the solution of (2) starting from x 0 satisfies x ( T ) = 0 . We say that system (2) is null-controllable in large if it is null-controllable from any x 0 2 . Also, inf u B ( θ ) T ( u ) is called optimal time of translation and u B ( θ ) realizing the minimum is called time optimal control.
Theorem 2. 
Under the assumptions of Theorem 1 system (2) is globally asymptotically stable and null controllable in large. Time optimal control exists and can be constructed explicitly.
Notice that the explicit form of the time optimal control requires some preliminary contraction and it is given in Section 4.
Further, we consider a pursuit-evasion differential game (1). Fix ρ , σ > 0 . A function u ( · ) B ( ρ ) ( v ( · ) B ( ρ ) ) is called an admissible control of the pursuer (evader).
Definition 4. 
A function u : [ 0 , T ] × 2 2 with coordinates u k ( t ) = v k ( t ) + ω k ( t ) , ω B ( ρ σ ) , which is an admissible control of the pursuer for every v 2 is called a strategy of the pursuer.
Theorem 3. 
Suppose that ρ > σ and the assumptions of Theorem 1 are satisfied. Then, for any admissible control of the evader v there exists a strategy of the pursuer u and ϑ 1 > 0 such that the solution of (1) satisfies z ( τ ) = 0 for some 0 τ ϑ 1 , i.e., the game (1) can be completed within time ϑ 1 .

3. Existence and Uniqueness

Notice that if we define x ( t ) = ( x 1 ( t ) , x 2 ( t ) , ) by setting every component x i as in (4), then x ( t ) satisfies the equation and initial conditions in (2). This also implies the uniqueness of a solution. Thus it is sufficient to prove that x ( · ) C ( [ 0 , T ] , 2 ) for any T > 0 . Now we will show that x ( t ) 2 for all t 0 .

3.1. Estimate for e t A

Since A = { A 1 , A 2 , }we have e t A = { e t A 1 , e t A 2 , }. Recall that for every i there exists a non-singular transformation P i : R d i R d i such that A i = P i J i P i 1 , where J i is the Jordan normal form of A i .
Thus,
e t A i     P i · e t J i · P i 1     C e t J i .
By the assumption all eigenvalues λ i 1 , , λ i d i of matrices have negative real part, letting 2 α i = max 1     j     d i R e ( λ j d i ) > 0 , we can find a polynomial Q i ( t ) of degree at most d i     d (see §13 in [22]) such that
e t A i     C | Q i ( t ) | e 2 t α i     C ¯ e t α i .
Thus, for any x 2 and t [ 0 , + ) we have
e t A x 2 = i = 1 e t A i x i 2 i = 1 e t A i 2 x i 2 C ¯ 2 x 2 .
This implies that e t A : 2 2 is a bounded linear operator for every t [ 0 , + ) . Also, it is standard to check that e t A is a semigroup, i.e., e ( t + s ) A = e t A e s A .

3.2. Proof of Theorem 1

We start by showing that x ( t ) 2 for all x 0 2 and for all t [ 0 , T ] . Indeed,
x ( t ) 2 i = 1 e t A i x i 0 + 0 t e ( t s ) A i w i ( s ) d s 2 2 e t A x 0 2 + 2 i = 1 0 t e ( t s ) A i w i ( s ) d s 2 .
Let us estimate the last term of the above inequality. We have
0 t e ( t s ) A i w i ( s ) d s 2 C ¯ 2 0 T w i ( s ) d s 2 C ¯ 2 T 0 T w i ( s ) 2 d s
where in the last step we have used the Cauchy–Schwartz inequality for 1 against w i ( s ) . First substituting (8) into (7) and then using (6), (5) and constraint (3) we obtain
x ( t ) 2 2 C ¯ 2 x 0 2 + 2 C ¯ 2 T θ 2 ,
which proves the claim.
We are now ready to prove that x ( t ) = ( x 1 ( t ) , x 2 ( t ) , ) C ( [ 0 , T ] , 2 ) for any T > 0 . Since x ( t ) 2 is bounded by a constant independent of t, for any ε > 0 there exists N = N ( ε , t , t 0 ) N such that
i = N + 1 x i ( t ) x i ( t 0 ) 2 ε 2 .
For any t , t 0 [ 0 , T ] with t 0 t we have
i = 1 N x i ( t ) x i ( t 0 ) 2 i = 1 N e t A i e t 0 A i 2 · x i 0 2 + + i = 1 N e t A i 0 t e s A i w i ( s ) d s e t 0 A i 0 t 0 e s A i w i ( s ) d s 2 = ( I ) + ( I I ) .
We start by estimating ( I ) . Notice that
e t A i e t 0 A i P i · P i 1 · e t J i e t 0 J i C ¯ e t 0 J i · | Q i ( t t 0 ) | e | t t 0 | α i .
Recall that Q i ( t t 0 ) is a polynomial of degree at most d with coefficients depending only on the dimension d i of J i . Thus, we can find δ independent of i such that
C ¯ 3 | Q i ( t t 0 ) | · x 0 2 < ε 4 and C ¯ 3 | Q i ( t t 0 ) | < ε 8 T
for all t ( t 0 δ , t 0 + δ ) . Thus, by (5) and (11) we have the following estimate for ( I ) :
i = 0 N e t A i e t 0 A i 2 · x 0 2 i = 0 N e t A i 2 · e ( t t 0 ) A i 2 · x 0 2 i = 0 N C ¯ 3 | Q i ( t t 0 ) | e | t t 0 | α i · x 0 2 < ε 4 .
For ( I I ) we write
i = 1 N ( e t A i e t 0 A i ) 0 t e s A i w i ( s ) d s e t 0 A i t 0 t e s A i w i ( s ) d s 2 .
Thus, for every i every sum and of the above sum is bound by
0 t e ( t s ) A i e ( t 0 s ) A i · w i ( s ) d s + t 0 t e ( t 0 s ) A i · w i ( s ) d s 2 .
Applying inequality (10) and (11) to the first summand and inequality (5) to the second we obtain
i = 1 N ε 8 T 0 T 1 [ 0 , t ] · w i ( s ) d s + 0 T 1 [ t 0 , t ] · C ¯ e t α i · w i ( s ) d s 2 ,
which is bound by
i = 1 N 0 T ε 8 T 1 [ 0 , t ] + 1 [ t 0 , t ] · C ¯ w i ( s ) d s 2 .
Now, using Cauchy–Schwartz inequality we obtain
ε 8 + | t 0 t | · C ¯ 2 i = 1 N 0 T w i ( s ) 2 d s .
Since | t t 0 | < δ choosing δ > 0 sufficiently small and using (3) we bound the latter expression by ε 4 for all ε < 4 θ 2 . Therefore, we conclude ( I I ) < ε 4 . Combining this, estimate (12) and (9) implies that we obtain that x ( · ) C ( [ 0 , 1 ] , 1 ) , hence finishes the proof.

4. Proof of Theorem 2

4.1. Asymptotic Stability

We will show that x ( t ) 0 as t . Since x 0 2 for any ε there exists N = N ( ε ) such that i = N + 1 x i 0 2 < ε 2 C ¯ . By (4) and (5) we have
x ( t ) 2 = i = 1 x i ( t ) 2 = i = 1 e t A i x i 0 2 i = 1 N C ¯ e t α i x i 0 2 + C ¯ i = N + 1 x i 0 2 .
Letting α min = min 1 i N α i > 0 , from the above inequality we obtain
x ( t ) 2 i = 1 N C ¯ e t α i x i 0 2 + C ¯ i = N x i 0 2 C ¯ e t α min x 0 + ε 2 .
There exists t ε such that C ¯ e t α min x 0 ε 2 for all t < t ε . This finishes the proof.
Notice that if α inf = inf i 1 α i > 0 , then the system is exponentially stable. Since in this case we do not have to cut at N and can write
x ( t ) 2 i = 1 C ¯ e t α i x i 0 2 C ¯ e t α inf i = 1 x i 0 2 C ¯ e t α inf x 0 2 .

4.2. Gramians

In this subsection, we prove null controllability of (1) and hence the proof of Theorem 2. Our approach relies on Gramian operators and observability inequalities. Set
W ( τ ) = 0 τ e s A · e s A * d s , τ R
where A * is the adjoint of A in 2 . The definition implies
W ( τ ) = { W 1 ( τ ) , W 2 ( τ ) , W 3 ( τ ) } , with W i ( τ ) = 0 τ e s A i · e s A i * d s , i 1 .
Since A i is a finite matrix for every i we have that W i ( τ ) is a positive definite, symmetric and invertible operator (Notice, that W ( τ ) is not necessarily a bounded operator for fixed τ R .) for every i and τ R , i.e., W i 1 ( τ ) exists and bounded. Define
W 1 ( τ ) = { W 1 1 ( τ ) , W 2 1 ( τ ) , W 3 1 ( τ ) }
It is clear that W 1 1 ( τ ) is inverse to W 1 ( τ ) for each τ R . We will show that W 1 ( τ ) : 2 2 is a bounded linear operator. For every s R , i N and x i R d i we have
W i ( τ ) x i , x i = 0 τ e s A i * x i 2 d s 0 τ ( m ( P i ) e β i s m ( P i 1 ) x i ) 2 d s = 0 τ e 2 β i s x i 2 P i 2 · P i 1 2 d s .
where m ( P i ) is the minimum seminorm of P i and β i = min 1 j d i R e ( λ j ) . Since the eigenvalues of A i assumed to have strictly negative real part bounded away from zero, we have β = inf i β i > 0 . Therefore, we have
W i ( τ ) W i ( τ ) x i , x i x 2 1 C 2 0 τ e 2 β i s d s 1 C 2 β i e 2 β i τ 1 ,
which implies
W i 1 ( τ ) 2 C 2 β i e 2 β i τ 1 1 C 2 / τ .
Further, for any x = ( x 1 , x 2 , ) 2 with x = 1 we have
W 1 ( τ ) x 2 = i = 1 W i 1 ( τ ) x i 2 i = 1 W i 1 ( τ ) 2 · x i 2 C 2 / τ .

4.3. Null Controllability in Large

Below we assume that θ > 0 and the set of admissible control is defined as in Section 2. Recall that x ( t ) = e t A x 0 + e t A 0 t e s A w ( s ) d s is the unique solution of system (2) with an initial state x ( 0 ) = x 0 . It is standard to check that the function
u 0 ( t ) = e t A * · W 1 ( τ ) x 0 for every x 0 2 , τ R +
solves the control problem if it is admissible, i.e., 0 τ e s A u 0 ( s ) d s = x 0 for every fixed τ R + . Indeed, by (15) we have
0 τ e t A i u 0 d t = 0 τ e t A i e t A i * d t · W i 1 ( τ ) x i 0 = x i 0 , for all i N .
Therefore, it remains to show that u 0 is admissible, i.e., there exists τ > 0 such that u 0 2 = i = 1 0 τ u i 0 ( s ) 2 d s θ 2 , u i 0 ( s ) R d i .
By definition of W ( τ ) and Chauchy–Schwarz inequality we have
0 τ u 0 ( t ) 2 d t = 0 τ e t A * W 1 ( τ ) u 0 2 d t = 0 τ e t A · e t A * W 1 ( τ ) x 0 , W 1 ( τ ) x 0 d t = x 0 , W 1 ( τ ) x 0 x 0 2 · W 1 ( τ ) .
This together with inequality (14) and (15) implies that u 0 is admissible if
C x 0 2 / τ θ 2 .
This finishes the proof, since the left hand side of (18) decays as τ grows.

4.4. Time Optimal Control

Equation (14) shows that x 0 , W 1 ( τ ) x 0 is decreasing as τ for every x 0 2 . Thus, for every x 0 2 there exists a unique ϑ R + such that
x 0 , W 1 ( τ ) x 0 > θ 2 , for τ > ϑ , and x 0 , W 1 ( ϑ ) x 0 = θ 2 .
We claim that ϑ is the optimal time. We use the following result from [23].
Proposition 1. 
Let B ( t ) , t [ 0 , ϑ 0 ] be a continuous matrix-function of the order d with a determinant not identically 0 on [ 0 , ϑ 0 ] . Then among the measurable functions w : [ 0 , ϑ 0 ] R d , satisfying the condition 0 ϑ 0 B ( s ) w ( s ) d s = w 0 R d the function defined almost everywhere on [ 0 , ϑ ] by the formula w ( s ) = B * F 1 ( ϑ 0 ) x 0 , F ( ϑ 0 ) = 0 ϑ 0 B ( s ) B * ( s ) d s gives a minimum to the functional 0 ϑ 0 | w ( s ) | 2 d s .
Assume that there is an admissible control u ( · ) defined on [ 0 , ϑ ) such that x ( τ ) = 0 for some τ < ϑ . By definition we have
e τ A i x 0 i + 0 τ e ( τ s ) A i u i ( s ) d s = 0 for all i N .
Since e ( τ s ) A i is a continuous matrix function we can apply the above proposition for every i N and conclude that the functional J ( u ) = 0 τ k = 1 u i ( s ) 2 d s is minimized by u 0 defined in (15). Thus we have
J ( u ) J ( u 0 ) = 0 τ k = 1 u i 0 ( s ) d s = x 0 , W 1 ( τ ) x 0 > x 0 , W 1 ( ϑ ) x 0 = θ 2 .
This shows that u ( · ) is not admissible. This contradiction implies that ϑ is the optimal time of translation to the origin and u 0 ( t ) = e t A * · W 1 ( ϑ ) x 0 is the time optimal control.

5. Differential Game Problem: Proof of Theorem 3

We now consider the game problem (1). Recall that the equation
x 0 , W 1 ( τ ) x 0 = ( ρ θ ) 2
has a unique solution ϑ 1 . Fix T > ϑ . We define
u ( t , v ) = v e t A * · W 1 ( ϑ 1 ) x 0
Let v ( · ) be any admissible control of the evader. We show that (20) is admissible.
u ( t , v ) = v + e t A * W 1 ( ϑ 1 ) x 0 σ + x 0 , W 1 ( ϑ 1 ) x 0 1 / 2 = ρ .
Also, it is easy to show that x ( ϑ 1 ) = 0 . This completes the proof.

6. Conclusions

In this paper, we studied an infinite controllable system consisting of independent finite dimensional blocks. We solved the optimal zero control problem and constructed a guaranteed strategy for pursuer to complete the pursuit game. We use Gramians in order to construct optimal control. It would be more desirable to consider a more general equation than (1), But we left this for further investigation. Since, our results don’t generalize to this setting, and also one needs to find an analog of the Kalmann condition on controllability.
We proved that the pursuit game can be completed if ρ < σ . Since in our setting the system is globally asymptotically stable and we expect that it is possible to complete the pursuit game for any ρ , σ > 0 . However, it turned out to be a challenging problem to define the strategy for 0 < ρ < σ . Also, we didn’t attempt here evasion problem. We think that in the interval ( 0 , ϑ 1 ) evasion is possible. However, we leave this for future work.

Author Contributions

Conceptualization, M.R., G.I., K.M., A.K. and B.A.P.; methodology, M.R., G.I., K.M., A.K. and B.A.P.; validation, M.R., G.I., K.M., A.K. and B.A.P.; formal analysis, M.R., G.I., K.M., A.K. and B.A.P.; investigation, M.R., G.I., K.M., A.K. and B.A.P.; writing—original draft preparation, M.R., G.I., K.M., A.K. and B.A.P.; writing—review and editing, M.R., G.I., K.M., A.K. and B.A.P.; supervision, G.I. All authors have read and agreed to the published version of the manuscript.

Funding

The research of M. Ruziboev (MR) is supported by the Austrian Science Fund (FWF): M2816 Meitner Grant.

Data Availability Statement

No new data were created or analyzed in this study. Data sharing is not applicable to this article.

Acknowledgments

The authors thank Abdulla Azamov for encouraging them to work on this project and his continuous attention.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Chernous’ko, F.L. Decomposition and suboptimal control in dynamical systems. J. Appl. Math. Mech. 1990, 54, 727–734. [Google Scholar] [CrossRef]
  2. Chernous’ko, F.L. Bounded controls in distributed-parameter systems. J. Appl. Math. Mech. 1992, 56, 707–723. [Google Scholar] [CrossRef]
  3. Chernous’ko, F.L. Decomposition and synthesis of control in nonlinear dynamical systems. Trudy Mat. Inst. Steklov. 1995, 211, 457–472. [Google Scholar]
  4. 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]
  5. Azamov, A.A.; Bakhramov, J.A.; Akhmedov, O.S. On the Chernous’ko time-optimal problem for the equation of heat conductivity in a rod. Ural Math. J. 2019, 5, 13–23. [Google Scholar] [CrossRef]
  6. 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]
  7. Agrachev, A.A.; Sarychev, A.V. Controllability of 2D Euler and Navier-Stokes equations by degenerate forcing. Commun. Math. Phys. 2006, 265, 673–697. [Google Scholar] [CrossRef]
  8. Badra, M.; Takahasi, T. On the Fattorini criterion for approximate controllability and stabilizability of parabolic systems. ESAIM Control Optim. Calc. Var. 2014, 20, 924–956. [Google Scholar] [CrossRef]
  9. Coron, J.; Xiang, S. Small-time global stabilization of the viscous Burgers equation with three scalar controls. J. Math. Pures Appl. 2021, 151, 212–256. [Google Scholar] [CrossRef]
  10. Coron, J. Control and Nonlinearity; Mathematical Surveys and Monographs, 136; American Mathematical Society: Providence, RI, USA, 2007; pp. xiv+426. [Google Scholar]
  11. Deimling, K. Ordinary Differential Equations in Banach Spaces; Lecture Notes in Mathematics; Springer: New York, NY, USA, 1977; Volume 596. [Google Scholar]
  12. Curtain, R.F.; Zwart, H. An Introduction to Infinite-Dimensional Linear Systems Theory; Springer: New York, NY, USA, 1995; pp. xviii+698. [Google Scholar]
  13. Azamov, A.A.; Ibragimov, G.I.; Mamayusupov, K.; Ruziboev, M. On the Stability and Null-Controllability of an Infinite System of Linear Differential Equations. J. Dyn. Control Syst. 2023, 29, 595–605. [Google Scholar] [CrossRef] [PubMed]
  14. Tukhtasinov, M.; Mamatov, M.S. On Pursuit Problems in Controlled Distributed Parameters Systems. Math. Notes 2008, 84, 256–262. [Google Scholar] [CrossRef]
  15. Satimov, N.Y.; Tukhtasinov, M. On Some Game Problems for First-Order Controlled Evolution Equations. Differ. Equ. 2005, 41, 1169–1177. [Google Scholar] [CrossRef]
  16. Satimov, N.Y.; Tukhtasinov, M. On Game Problems for Second-Order Evolution Equations. Russ. Math. 2007, 51, 49–57. [Google Scholar] [CrossRef]
  17. Ibragimov, G.I. Optimal pursuit time for a differential game in the Hilbert space l2. Sci. Asia 2013, 39S, 25–30. [Google Scholar] [CrossRef]
  18. Ibragimov, G.I.; Ferrara, M.; Ruziboev, M.; Pansera, B.A. Linear evasion differential game of one evader and several pursuers with integral constraints. Int. J. Game Theory 2021, 50, 729–750. [Google Scholar] [CrossRef]
  19. Ibragimov, G.I. Evasion Differential Game of One Evader and Many Slow Pursuers. Dyn. Games Appl. 2023. [Google Scholar] [CrossRef]
  20. Kuchkarov, A.S.; Ibragimov, G.I.; Ferrara, M. Simple motion pursuit and evasion differential games with many pursuers on manifolds with Euclidean metric. Discret. Dyn. Nat. Soc. 2016, 2016, 1386242. [Google Scholar] [CrossRef]
  21. Daletskii, A.; Finkelshtein, D. Non-equilibrium particle dynamics with unbounded number of interacting neighbors. (English summary). J. Stat. Phys. 2008, 173, 1639–1659. [Google Scholar] [CrossRef]
  22. Demidovič, B.P. Lektsii po Matematicheskoĭ Teorii Ustoĭchivosti; Izdat; Nauka: Moscow, Russia, 1967; p. 472. [Google Scholar]
  23. Lee, E.B.; Markus, L. Foundations of Optimal Control Theory; John Wiley & Sons, Inc.: New York, NY, USA; London, UK; Sydney, Australia, 1967; pp. x+576. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Ruziboev, M.; Ibragimov, G.; Mamayusupov, K.; Khaitmetov, A.; Pansera, B.A. On a Linear Differential Game in the Hilbert Space 2. Mathematics 2023, 11, 4987. https://0-doi-org.brum.beds.ac.uk/10.3390/math11244987

AMA Style

Ruziboev M, Ibragimov G, Mamayusupov K, Khaitmetov A, Pansera BA. On a Linear Differential Game in the Hilbert Space 2. Mathematics. 2023; 11(24):4987. https://0-doi-org.brum.beds.ac.uk/10.3390/math11244987

Chicago/Turabian Style

Ruziboev, Marks, Gafurjan Ibragimov, Khudoyor Mamayusupov, Adkham Khaitmetov, and Bruno Antonio Pansera. 2023. "On a Linear Differential Game in the Hilbert Space 2" Mathematics 11, no. 24: 4987. https://0-doi-org.brum.beds.ac.uk/10.3390/math11244987

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