Open AccessArticle

Differential Games for an Infinite 2-Systems of Differential Equations

Muminjon Tukhtasinov

^1,†,

Gafurjan Ibragimov

^2,†

Sarvinoz Kuchkarova

^1,† and

Risman Mat Hasim

^2,*

National University of Uzbekistan, University Street, Al-Mazar District, Tashkent 1000174, Uzbekistan

Department of Mathematics, Faculty of Science, University Putra Malaysia, Serdang 43400, Malaysia

Author to whom correspondence should be addressed.

^†

These authors contributed equally to this work.

Mathematics 2021, 9(13), 1467; https://doi.org/10.3390/math9131467

Submission received: 17 May 2021 / Revised: 4 June 2021 / Accepted: 6 June 2021 / Published: 23 June 2021

(This article belongs to the Special Issue Mathematical Game Theory 2021)

Download Versions Notes

Abstract

A pursuit differential game described by an infinite system of 2-systems is studied in Hilbert space

l_{2}

. Geometric constraints are imposed on control parameters of pursuer and evader. The purpose of pursuer is to bring the state of the system to the origin of the Hilbert space

l_{2}

and the evader tries to prevent this. Differential game is completed if the state of the system reaches the origin of

l_{2}

. The problem is to find a guaranteed pursuit and evasion times. We give an equation for the guaranteed pursuit time and propose an explicit strategy for the pursuer. Additionally, a guaranteed evasion time is found.

Keywords:

pursuer; evader; constraints; strategy

1. Introduction

The notion of differential games was introduced by Isaacs [1]. Differential games were developed by Bercovitz [2], Elliot and Kalton [3], Fleming [4,5], Friedman [6], Hajek [7], Ho, Bryson, and Baron [8], Pontryagin [9], Krasovskii [10], Petrosyan [11], Pshenichnyi [12], Subbotin [13], Chikrii [14], and others.

There are many works which deal with the infinite dimensional spaces, such as [15,16,17,18,19]. Differential games studied in the works [17,19,20,21,22] are devoted to constructing of the optimal strategies of players.

In the paper of Satimov and Tukhtasinov [23], pursuit and evasion differential games were studied for the parabolic equation. Various cases of control constraints (integral, geometric) were analyzed. Two sets were specified such that pursuit can be completed if the initial state belongs to the first set, and evasion is possible if the initial state belongs to the second set. Note that, the works [24,25] also relates to differential games described by PDE.

In the game with countably many pursuers studied Ibragimov et al. [17] in the Hilbert space

l_{2}

, the duration of the game is prescribed. A formula for the value of the game was found and optimal strategies of the players were constructed explicitly. In the work by Salimi and Ferrara [26], an optimal approach of a finite or denumerable pursuers to one evader is studied. In that paper a formula for the value of the game and optimal strategies of players are proposed. A time-optimal problem of transition of the state of system into the origin was studied by Azamov and Ruziboev [27]. The main result of that paper is estimate of the optimal time from above.

In the present paper, we study differential game problems described by an infinite system of 2-systems of differential equations. We find a guaranteed pursuit time for the pursuit differential game and a guaranteed evasion time for the evasion differential game.

2. Motivation

The work [28] the first paper on time-optimal control problem for the parabolic type partial differential equations. The optimal control problems in systems with distributed parameters is widely studied [29]. Interesting results were obtained by Albeverio and Alimov [30] for a time-optimal control problem for the parabolic differential equation where the control function is defined on the boundary, and by Chaves-Silva et al. [31] for the null controllability of evolution equations with memory terms, and by Philippe Martin et al. [32] for the structurally damped wave equation where the null controllability holds in some suitable Sobolev space and after a fixed positive time independent of the initial conditions.

Differential game problems described by partial differential equations are considered for the first time in the works [33,34]. One of the main tools in studying control or/and differential game problems for the systems described by partial differential equations is the method of Fourier. We can use this method to reduce differential game problems described by partial differential equations to differential game problems described by an infinite system of differential equations [23,24,25,27,35,36,37,38,39,40].

Indeed, let a controlled distributed system be described by the following parabolic equation

\frac{\partial z}{\partial t} + A z = w, z (x, 0) = z_{0} (x), x \in D, z (x, t) = 0, x \in \partial D, 0 < t < T,

(1)

where

z = z (x, t)

is the state of the system,

z_{0} (x) \in L_{2} (D)

x = (x_{1}, x_{2}, \dots, x_{n}) \in D \subset R^{n}

n \geq 1

, D is a bounded domain, and it is assumed that the boundary

\partial D

of D is piecewise smooth,

t \in [0, T]

, and

T > 0

is a given number,

w = w (x, t)

w (x, t) \in L_{2} (C_{T})

, is the control function,

C_{T}

is the following open cylinder

C_{T} = {(x, t) | x \in D, 0 < t < T} \subset R^{n + 1},

operator

A z

is defined by the equation

A z = - \sum_{i, j = 1}^{n} \frac{\partial}{\partial x_{i}} (a_{i j} (x) \frac{\partial z}{\partial x_{j}}), a_{i j} (x) = a_{j i} (x),

a_{i j} (x)

are assumed to be bounded measurable functions. Additionally,

\sum_{i, j = 1}^{n} a_{i j} (x) η_{i} η_{j} \geq k \sum_{i = 1}^{n} η_{i}^{2}

for all

(η_{1}, η_{2}, \dots, η_{n}) \in R^{n}

x \in D

, and for some positive number k.

Then, for any

w (x, t) \in L_{2} (C_{T})

and

z_{0} (x) \in L_{2} (D)

, problem (1) has the only generalized solution

z = z (x, t)

in the set

{\overset{˚}{W}}_{2}^{1, 0} (C_{T})

[41]. Moreover, the solution can be represented in the form ([41], III.3)

z (x, t) = \sum_{i = 1}^{\infty} z_{i} (t) v_{i} (x),

(2)

where

z_{i} (t)

t \in [0, T]

i = 1, 2, \dots

, are solutions of the following initial value problems

{\dot{z}}_{i} = λ_{i} z_{i} + w_{i} (t), z_{i} (0) = z_{i 0}, i = 1, 2, \dots,

(3)

the coefficients

λ_{1}, λ_{2}, \dots, λ_{i}, \dots

are positive and they are the generalized eigenvalues of the operator A [37], and

λ_{i} \to + \infty

i \to \infty

v_{1} (x), v_{2} (x), \dots, v_{i} (x), \dots

are the generalized eigenfunctions of A, which form a complete orthonormal system in

L_{2} (D)

, and

w_{i} (t)

and

z_{i 0}

are the Fourier coefficients of of the functions

w (x, t)

and

z_{0} (x)

, respectively, relative to the system

{v_{i} (x)}

w (x, t) = \sum_{i = 1}^{\infty} w_{i} (t) v_{i} (x), z_{0} (x) = \sum_{i = 1}^{\infty} z_{i 0} v_{i} (x) .

Additionally, the series (2) uniformly converges in

L_{2} (C_{T})

, and its sum

z (x, t)

belongs to the Sobolev space

{\overset{˚}{W}}_{2}^{1} (D)

for every t,

0 \leq t \leq T

, and is a continuous in t in

{\overset{˚}{W}}_{2}^{1} (D)

[41].

For example, in the works [23,24,38,39], a differential game for a PDE of the form

\frac{\partial z}{\partial t} = A z + u - v, A z = - \sum_{i, j = 1}^{n} \frac{\partial}{\partial x_{i}} (a_{i j} (x) \frac{\partial z}{\partial x_{i}}),

was studied by reducing to the following infinite system

{\dot{z}}_{k} + λ_{k} z_{k} = u_{k} - v_{k}, k = 1, 2, \dots,

(4)

where

u_{k}

and

v_{k}

are control parameters of pursuer and evader, respectively,

z_{k}, u_{k}, v_{k} \in R

, and coefficients

λ_{k}

k = 1, 2, \dots

, satisfy the condition

0 < λ_{1} \leq λ_{2} \leq \dots \to \infty

Thus, differential games for the infinite system of differential Equation (3) are closely related to those for partial differential Equation (1). Therefore, we study differential games for the infinite system of differential Equation (3) separately assuming that

λ_{1}, λ_{2}, \dots

are any numbers. Note that the differential equations we’ll consider in the following section correspond to complex numbers

λ_{i}

3. Statement of Problem

We study a differential game for the following system

\begin{matrix} \dot{x_{i}} = - α_{i} x_{i} - β_{i} y_{i} + u_{i 1} - v_{i 1}, & x_{i} (0) = x_{i 0}, \\ \dot{y_{i}} = β_{i} x_{i} - α_{i} y_{i} + u_{i 2} - v_{i 2}, & y_{i} (0) = y_{i 0}, \end{matrix}

(5)

in Hilbert space

l_{2}

, where

α_{i}, β_{i}

are real numbers,

α_{i} \geq 0

(x_{10}, x_{20}, \dots), (y_{10}, y_{20}, \dots) \in l_{2}

, pursuer’s control parameter

u = (u_{1}, u_{2}, \dots)

and evader’s control parameter

v = (v_{1}, v_{2}, \dots)

consist of 2-vectors

u_{i} = (u_{i 1}, u_{i 2})

and

v_{i} = (v_{i 1}, v_{i 2})

i = 1, 2, \dots

, respectively. Throughout the paper we assume that

0 \leq t \leq T

, where T is a sufficiently large number, and

z_{0} = (x_{10}, y_{10}, x_{20}, y_{20}, \dots) \neq 0

Let

ρ

and

σ

be given positive numbers.

Definition 1.

An admissible control of pursuer is a function

u (t) = (u_{1} (t), u_{2} (t), \dots)

t \in [0, T]

, whose coordinates

u_{i} (t)

are measurable and satisfy the condition

\sum_{i = 1}^{\infty} (u_{i 1}^{2} (t) + u_{i 2}^{2} (t)) \leq ρ^{2}, 0 \leq t \leq T .

(6)

Definition 2.

An admissible control of evader is a function

v (t) = (v_{1} (t), v_{2} (t), \dots)

t \in [0, T]

, whose coordinates

v_{i} (t)

are measurable and satisfy the condition

\sum_{i = 1}^{\infty} (v_{i 1}^{2} (t) + v_{i 2}^{2} (t)) \leq σ^{2}, 0 \leq t \leq T .

(7)

It is assumed that

ρ > σ

. Let

z_{i} (t) = [\begin{matrix} x_{i} (t) \\ y_{i} (t) \end{matrix}], z_{i 0} = [\begin{matrix} x_{i 0} \\ y_{i 0} \end{matrix}], U_{i} = [\begin{matrix} U_{i 1} \\ U_{i 2} \end{matrix}], v_{i} = [\begin{matrix} v_{i 1} \\ v_{i 2} \end{matrix}],

Definition 3.

A strategy of pursuer is a function of the form

U (t, v) = U^{0} (t) + v = (U_{1}^{0} (t) + v_{1}, U_{2}^{0} (t) + v_{2}, \dots), U_{i}^{0} (t) = (U_{i 1}^{0} (t), U_{i 2}^{0} (t)),

where

U^{0} (t) = (U_{1}^{0} (t), U_{2}^{0} (t), \dots)

has measurable coordinates

U_{i}^{0} (t)

0 \leq t \leq T

, that satisfy the condition

\sum_{i = 1}^{\infty} ({(U_{i 1}^{0} (t))}^{2} + {(U_{i 2}^{0} (t))}^{2}) \leq {(ρ - σ)}^{2}, 0 \leq t \leq T .

We denote

A_{i} (t) = e^{- α_{i} t} [r r cos β_{i} t - sin β_{i} t sin β_{i} t cos β_{i} t], i = 1, 2, \dots .

We can easily see that the matrix

A_{i} (t)

has the following properties:

A_{i} (t + h) = A_{i} (t) A_{i} (h), A_{i}^{- 1} (t) = A_{i} (- t) = e^{α_{i} t} [r r cos β_{i} t sin β_{i} t - sin β_{i} t cos β_{i} t] .

Each equation of the system (5) has the unique solution

z (t) = (z_{1} (t), z_{2} (t), \dots)

defined by

z_{i} (t) = A_{i} (t) z_{i 0} + \int_{0}^{t} A_{i} (t - s) (u_{i} (s) - v_{i} (s)) d s, i = 1, 2, \dots,

hence,

z_{i} (t) = A_{i} (t) [z_{i 0} + \int_{0}^{t} A_{i} (- s) (u_{i} (s) - v_{i} (s)) d s], i = 1, 2, \dots

(8)

The relations (8) imply that

z (t) = 0

is equivalent to

η (t) = 0

, where

η (t) = (η_{1} (t), η_{2} (t), \dots), η_{i} (t) = z_{i 0} + \int_{0}^{t} A_{i} (- s) (u_{i} (s) - v_{i} (s)) d s, i = 1, 2, \dots

(9)

Definition 4.

We call the number a guaranteed pursuit time if for some strategy of pursuer U and for any admissible control of the evader,

z (t^{'}) = 0

at some

t^{'}

0 \leq t^{'} \leq

, where

z (t) = (z_{1} (t), z_{2} (t), \dots)

is the solution of the initial value problem (5).

The pursuer is interested in minimizing the guaranteed pursuit time.

Definition 5.

A number τ is called a guaranteed evasion time if for any number

τ^{'}

0 \leq τ^{'} < τ

, we can construct an admissible control

v_{0} (t)

such that, for the evader such that for any admissible control of the pursuer, we have

z (t) \neq 0

for all

0 \leq t \leq τ^{'}

and

i = 1, 2, \dots

The evader is interested in minimizing the guaranteed evasion time.

Problem 1.

Find an equation for a guaranteed pursuit time θ and a guaranteed evasion time τ in the game (5).

Note that a differential game with integral constraints described by the system (5) was studied in [22]. The present paper dealt with the differential game where the controls of players are subjected to geometric constraints (6) and (7).

4. Result

In this section we find a guaranteed pursuit time

θ

and construct a strategy for the pursuer that guarantees the time

θ

Theorem 1.

The number θ that satisfy the equation

\sum_{α_{i} > 0} \frac{α_{i}^{2} {| z_{i 0} |}^{2}}{{sinh}^{2} (α_{i} θ)} + \frac{1}{θ^{2}} \sum_{α_{i} = 0} {| z_{i 0} |}^{2} = {(ρ - σ)}^{2}

(10)

is a guaranteed pursuit time in the game (5).

It should be noted that the series on the left hand side of Equation (6) is a decreasing continuous function of on

(0, \infty)

, approaches

+ \infty

\to 0 +

, and approaches 0 as

\to + \infty

Proof.

Let

W_{i} (θ) = \int_{0}^{θ} A_{i} (- s) A_{i}^{T} (- s) d s .

We have

\begin{matrix} W_{i} (θ) & = \int_{0}^{θ} e^{2 α_{i} s} [\begin{matrix} cos β_{i} s & sin β_{i} s \\ - sin β_{i} s & cos β_{i} s \end{matrix}] [\begin{matrix} cos β_{i} s & - sin β_{i} s \\ sin β_{i} s & cos β_{i} s \end{matrix}] d s \\ = \int_{0}^{θ} e^{2 α_{i} s} [\begin{matrix} 1 & 0 \\ 0 & 1 \end{matrix}] d s = φ_{i} (θ) I, \end{matrix}

where

φ_{i} (θ) = \{\begin{matrix} \frac{1}{2 α_{i}} (e^{2 α_{i} θ} - 1), & α_{i} \neq 0 \\ θ, & α_{i} = 0 \end{matrix}, I = [\begin{matrix} 1 & 0 \\ 0 & 1 \end{matrix}] .

We define the strategy for the pursuer as follows

U_{i} (t) = \{\begin{matrix} - A_{i}^{T} (- t) W_{i}^{- 1} (θ) z_{i 0} + v_{i} (t), & 0 \leq t \leq θ, \\ v_{i} (t), & t > θ \end{matrix}

(11)

Note that

U_{i}^{0} (t)

i = 1, 2, \dots

, in Definition 3 are defined by the equations

U_{i}^{0} (t) = \{\begin{matrix} - A_{i}^{T} (- t) W_{i}^{- 1} (θ) z_{i 0}, & 0 \leq t \leq θ \\ 0, & t > θ \end{matrix}, i = 1, 2, \dots

(12)

To show that the strategy (11) is admissible, we show that

\sum_{i = 1}^{\infty} | U_{i}^{0} {(t) |}^{2} = \sum_{i = 1}^{\infty} {| - A_{i}^{T} (- t) W_{i}^{- 1} (θ) z_{i 0} |}^{2} \leq {(ρ - σ)}^{2} .

Indeed, since

- A_{i}^{T} (- t) W_{i}^{- 1} (θ) z_{i 0} = - \frac{e^{α_{i} t}}{φ_{i} (θ)} [\begin{matrix} cos β_{i} t & sin β_{i} t \\ - sin β_{i} t & cos β_{i} t \end{matrix}] z_{i 0},

we have

\begin{matrix} |A_{i}^{T} (- t) W_{i}^{- 1} (θ) z_{i 0}| & = \frac{e^{α_{i} t}}{φ_{i} (θ)} |[\begin{matrix} x_{i 0} cos β_{i} t + y_{i 0} sin β_{i} t \\ - x_{i 0} sin β_{i} t + y_{i 0} cos β_{i} t \end{matrix}]| \\ = \frac{e^{α_{i} t}}{φ_{i} (θ)} \cdot \sqrt{x_{i 0}^{2} + y_{i 0}^{2}} \\ \leq \frac{e^{α_{i}}}{φ_{i} (θ)} \cdot | z_{i 0} | = \{\begin{matrix} \frac{α_{i} | z_{i 0} |}{sinh (α_{i} θ)} & α_{i} > 0, \\ \frac{1}{} & α_{i} = 0 . \end{matrix} \end{matrix}

This implies that

\begin{matrix} \sum_{i = 1}^{\infty} {| U_{i}^{0} (t) |}^{2} & = & \sum_{i = 1}^{\infty} {| - A_{i}^{T} (- s) W_{i}^{- 1} (θ) z_{i 0} |}^{2} \\ \leq & \sum_{α_{i} > 0} \frac{α_{i}^{2} {| z_{i 0} |}^{2}}{{sinh}^{2} (α_{i} θ)} + \frac{1}{θ^{2}} \sum_{α_{i} = 0} {| z_{i 0} |}^{2} . \end{matrix}

We are now in position to prove the admissibility of strategy (11). By the Minkowskii inequality and the definition of

θ

we have, for

0 \leq t \leq θ

\begin{matrix} ∥ U (t) ∥ & = ∥ U_{0} (t) + v (t) ∥ \leq ∥ U_{0} (t) ∥ + ∥ v (t) ∥ \\ = {(\sum_{i = 1}^{\infty} {| U_{i}^{0} (t) |}^{2})}^{1 / 2} + {(\sum_{i = 1}^{\infty} {|v_{i} (t)|}^{2})}^{1 / 2} \\ \leq {(\sum_{α_{i} > 0} \frac{α_{i}^{2} {| z_{i 0} |}^{2}}{{sinh}^{2} (α_{i} θ)} + \frac{1}{θ^{2}} \sum_{α_{i} = 0} {| z_{i 0} |}^{2})}^{1 / 2} + σ = ρ - σ + σ = ρ . \end{matrix}

The proof of admissibility of strategy

U (t)

is complete.

To show that

θ

is a guaranteed pursuit time, we show that

z (θ) = 0

. To this end we show that

η_{i} (θ) = 0, i = 1, 2, \dots .

(13)

Indeed, by (11)

\begin{matrix} η_{i} (θ) & = z_{i 0} + \int_{0}^{θ} A_{i} (- s) (U_{i} (s) - v_{i} (s)) d s \\ = z_{i 0} + \int_{0}^{θ} A_{i} (- s) (- A_{i}^{T} (- s) W_{i}^{- 1} (θ) z_{i 0}) d s \\ = z_{i 0} - z_{i 0} = 0, \end{matrix}

and so

z_{i} (θ) = 0

, hence,

z (θ) = 0 .

Thus, pursuit is completed at the time

θ

. This completes the proof of the theorem. □

5. Guaranteed Evasion Time

In this section, we study the evasion differential game and we find a guaranteed evasion time

τ

. We prove the following statement.

Theorem 2.

For any initial state

z_{0} = (z_{10}, z_{20}, \dots)

, the number

τ = sup_{i} τ_{i}, τ_{i} = \{\begin{matrix} \frac{1}{α_{i}} ln (\frac{α_{i} | z_{i 0} |}{ρ - σ} + 1), & α_{i} > 0 \\ \frac{| z_{i 0} |}{ρ - σ}, & α_{i} = 0 \end{matrix}

is a guaranteed evasion time in game (5).

Proof.

Let pursuer apply an arbitrary admissible control

u = u (t)

. Let

τ^{'}

be an arbitrary time that satisfies the condition

0 < τ^{'} < τ

. To prove the theorem, we construct an admissible control for the evader, such that

z (t) \neq 0

0 \leq t < τ^{'}

. Indeed, by definition of

τ

there exists

j \in {1, 2, \dots}

such that

τ^{'} < τ_{j}

. Show that there is a control of the evader such that

z (t) \neq 0

0 \leq t < τ_{j}

. Observe

z_{j 0} \neq 0

since otherwise

τ_{j} = 0

contradicting positivity of

τ_{j}

. Let

e_{j} = \frac{z_{j 0}}{| z_{j 0} |}

and

v_{j} (t) = - σ [\begin{matrix} cos β_{j} t & sin β_{j} t \\ - sin β_{j} t & cos β_{j} t \end{matrix}] e_{j}, v_{i} (t) = 0, i = 1, 2, \dots, i \neq j, t \in [0, τ_{j}) .

(14)

Then, for any admissible control of the pursuer

u (\cdot)

and time

t \in [0, τ_{j})

, we have

\begin{matrix} η_{j} (t) & = & z_{j 0} + \int_{0}^{t} A_{i} (- s) u_{j} (s) d s - \int_{0}^{t} A_{i} (- s) v_{j} (s) d s \\ = & z_{j 0} + \int_{0}^{t} A_{i} (- s) u_{j} (s) d s + σ e_{j} \int_{0}^{t} e^{α_{j} s} d s . \end{matrix}

From this using the inequality

| (A_{i} (- s) u_{j} (s), e_{i}) | \leq ρ e^{α_{j} s}

and the definition of

τ_{j}

we obtain

\begin{matrix} η_{j} (t) e_{j} = & | z_{j 0} | + \int_{0}^{t} (A_{i} (- s) u_{j} (s), e_{i}) d s + σ \int_{0}^{t} e^{α_{j} s} d s \\ \geq & | z_{j 0} | - ρ \int_{0}^{t} e^{α_{j} s} d s + σ \int_{0}^{t} e^{α_{j} s} d s \\ > & | z_{j 0} | - (ρ - σ) \int_{0}^{τ_{j}} e^{α_{j} s} d s = 0 . \end{matrix}

Consequently,

η_{j} (t) \neq 0

and hence

z_{j} (t) \neq 0

by (9), therefore,

z (t) \neq 0

for

t \in [0, τ_{j})

. In particular,

z (t) \neq 0

on the interval

[0, τ^{'}]

. This completes the proof of Theorem 2. □

6. Discussion

We have studied a pursuit and evasion differential games for an infinite system of differential equations. We have obtained a formula for the guaranteed pursuit time. Additionally, we have constructed an explicit strategy for the pursuer that ensures the completion of the game by the guaranteed pursuit time.

We estimate the guaranteed pursuit time

θ

. Using the Taylor series, for

α_{i} \neq 0

, we have

\begin{matrix} \frac{α_{i}}{sinh α_{i} θ} & = \frac{2 α_{i}}{e^{α_{i} θ} - e^{- α_{i} θ}} \\ = \frac{2 α_{i}}{1 + α_{i} θ + \frac{α_{i}^{2} θ^{2}}{2!} + \frac{α_{i}^{3} θ^{3}}{3!} + \dots - (1 - α_{i} θ + \frac{α_{i}^{2} θ^{2}}{2!} - \frac{α_{i}^{3} θ^{3}}{3!} + \dots)} \\ = \frac{2 α_{i}}{2 α_{i} θ (1 + \frac{α_{i}^{2} θ^{2}}{3!} + \frac{α_{i}^{4} θ^{4}}{5!} + \dots)} \leq \frac{1}{θ} . \end{matrix}

Therefore, we obtain from (10) that

\begin{matrix} {(ρ - σ)}^{2} & = & \sum_{α_{i} > 0} \frac{α_{i}^{2} {| z_{i 0} |}^{2}}{{sinh}^{2} (α_{i} θ)} + \sum_{α_{i} = 0} \frac{| z_{i 0} |^{2}}{θ^{2}} \\ \leq & \sum_{α_{i} > 0} \frac{| z_{i 0} |^{2}}{θ^{2}} + \sum_{α_{i} = 0} \frac{| z_{i 0} |^{2}}{θ^{2}} = \frac{| z_{0} |^{2}}{θ^{2}}, \end{matrix}

where

| z_{0} | = {(\sum_{i = 1}^{\infty} {| z_{i 0} |}^{2})}^{1 / 2} .

Hence,

θ \leq \frac{| z_{0} |}{ρ - σ} .

Thus, the guaranteed pursuit time is less than or equal to

| z_{0} | / (ρ - σ)

. Hence, the strategy of pursuer (11) guarantees the completion of the game by the time

| z_{0} | / (ρ - σ)

Additionally, we have obtained a formula for the guaranteed evasion time.

Author Contributions

Investigation, M.T., G.I., S.K. and R.M.H.; Methodology, M.T., G.I., S.K. and R.M.H.; Project administration, S.K. and R.M.H.; Supervision, G.I.; Validation, M.T., G.I., S.K. and R.M.H.; Writing original draft, M.T., G.I., S.K. and R.M.H.; Writing review and editing, M.T., G.I., S.K. and R.M.H. All authors have read and agreed to the published version of the manuscript.

Funding

The present research was partially supported by the National Fundamental Research Grant Scheme FRGS of Malaysia, FRGS/1/2017/STG06/UPM/02/9.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

Isaacs, R. Differential Games; John Wiley & Sons: New York, NY, USA, 1965. [Google Scholar]
Berkovitz, L.D. A Survey of Differential Games, Mathematical Theory of Control; Academic Press: New York, NY, USA, 1967; pp. 373–385. [Google Scholar]
Elliot, R.J.; Kalton, N.J. The Existence of Value for Differential Games; American Mathematical Soc.: Providence, RI, USA, 1972. [Google Scholar]
Fleming, W.H. A note on differential games of prescribed duration. Contrib. Theory Games 1957, 3, 407–416. [Google Scholar]
Fleming, W.H. The convergence problem for differential games. J. Math. Anal. Appl. 1961, 3, 102–116. [Google Scholar] [CrossRef] [Green Version]
Friedman, A. Differential Games; Wiley Interscience: New York, NY, USA, 1971. [Google Scholar]
Hajek, O. Pursuit Games; Academic Press: New York, NY, USA, 1975. [Google Scholar]
Ho, Y.; Bryson, A.; Baron, S. Differential games and optimal pursuit-evasion strategies. IEEE Trans. Autom. Control 1965, 10, 385–389. [Google Scholar] [CrossRef]
Pontryagin, L.S. Selected Works; Nauka: Moscow, Russia, 1988. [Google Scholar]
Krasovskii, N.N.; Subbotin, A.I. Game-Theoretical Control Problems; Springer: New York, NY, USA, 1988. [Google Scholar]
Petrosyan, L.A. Differential Games of Pursuit; World Scientific: Singapore, 1993. [Google Scholar]
Pshenichnii, B.N. Simple pursuit by several objects. Cybern. Syst. Anal. 1976, 12, 484–485. [Google Scholar] [CrossRef]
Subbotin, A.I.; Chentsov, A.G. Optimization of Guaranteed Result in Control Problems; Nauka: Moscow, Russia, 1981. [Google Scholar]
Chikrii, A.A. Conflict-Controlled Processes; Kluwer: Dordrecht, The Netherlands, 1997. [Google Scholar]
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]
Ibragimov, G.I.; Risman, M.H. Pursuit and Evasion Differential game in Hilbert space. Int. Game Theory Rev. 2010, 12, 239–251. [Google Scholar] [CrossRef]
Ibragimov, G.; Norshakila, A.R.; Kuchkarov, A.; Fudziah, I. Multi Pursuer Differential Game of Optimal Approach with Integral Constraints on Controls of Players. Taiwan J. Math. 2015, 19, 963–976. [Google Scholar] [CrossRef]
Idham, A.A.; Gafurjan, I.; Askar, R. Evasion Differential Game of Infinitely Many Evaders from Infinitely Many Pursuers in Hilbert Space. Dyn. Games Appl. 2017. [Google Scholar] [CrossRef]
Salimi, M.; Ibragimov, G.I.; Siegmund, S.; Sharifi, S. On a fixed duration pursuit differential game with geometric and integral constraints. Dyn. Games Appl. 2016, 6, 409–425. [Google Scholar] [CrossRef]
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]
Ibragimov, G.I. Optimal pursuit with countably many pursuers and one evader. Differ. Equ. 2005, 41, 627–635. [Google Scholar] [CrossRef]
Ibragimov, G.I. Optimal pursuit time for a differential game in the Hilbert space l₂. Sci. Asia 2013, 39, 25–30. [Google Scholar] [CrossRef] [Green Version]
Satimov, N.Y.; Tukhtasinov, M. On Some Game Problems for First-Order Controlled Evolution Equations. Differ. Equ. 2005, 41, 1169–1177. [Google Scholar] [CrossRef]
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]
Satimov, N.Y.; Tukhtasinov, M. On Game Problems for Second-Order Evolution Equations. Russ. Math. 2007, 51, 49–57. [Google Scholar] [CrossRef]
Salimi, M.; Ferrara, M. Differential game of optimal pursuit of one evader by many pursuers. Int. J. Game Theory 2019, 48, 481–490. [Google Scholar] [CrossRef]
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]
Fattorini, H.O. Time-Optimal control of solutions of operational differential equations. SIAM J. Control 1964, 2, 54–59. [Google Scholar]
Fursikov, A.V. Optimal Control of Distributed Systems, Theory and Applications, Translations of Math. Monographs; American Mathematical Soc.: Providence, RI, USA, 2000. [Google Scholar]
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]
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]
Philippe, M.; Lionel, R.; Pierre, R. Null controllability of the structurally damped wave equation with moving control. SIAM J. Control Optim. 2013, 51, 660–684. [Google Scholar] [CrossRef] [Green Version]
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]
Osipov, Y.S. The theory of differential games in systems with distributed parameters. Dokl Akad. Nauk SSSR 1975, 223, 1314–1317. [Google Scholar]
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]
Butkovskiy, A.G. Theory of Optimal Control of Distributed Parameter Systems; Elsevier: New York, NY, USA, 1969. [Google Scholar]
Chernous’ko, F.L. Bounded controls in distributed-parameter systems. J. Appl. Math. Mech. 1992, 56, 707–723. [Google Scholar] [CrossRef]
Ibragimov, G.I. A Problem of Optimal Pursuit in Systems with Distributed Parameters. J. Appl. Math. Mech. 2002, 66, 719–724. [Google Scholar] [CrossRef]
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]
Tukhtasinov, M.; Mamatov, M.S. On Pursuit Problems in Controlled Distributed Parameters Systems. Math. Notes 2008, 84, 256–262. [Google Scholar] [CrossRef]
Ladyzhenskaya, O.A. Kraevye Zadachi Matematicheskoy Fiziki; Boundary value Problems of Mathematical Physics: Moscow, Russia, 1973. [Google Scholar]

Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

© 2021 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).

Share and Cite

MDPI and ACS Style

Tukhtasinov, M.; Ibragimov, G.; Kuchkarova, S.; Mat Hasim, R. Differential Games for an Infinite 2-Systems of Differential Equations. Mathematics 2021, 9, 1467. https://doi.org/10.3390/math9131467

AMA Style

Tukhtasinov M, Ibragimov G, Kuchkarova S, Mat Hasim R. Differential Games for an Infinite 2-Systems of Differential Equations. Mathematics. 2021; 9(13):1467. https://doi.org/10.3390/math9131467

Chicago/Turabian Style

Tukhtasinov, Muminjon, Gafurjan Ibragimov, Sarvinoz Kuchkarova, and Risman Mat Hasim. 2021. "Differential Games for an Infinite 2-Systems of Differential Equations" Mathematics 9, no. 13: 1467. https://doi.org/10.3390/math9131467

APA Style

Tukhtasinov, M., Ibragimov, G., Kuchkarova, S., & Mat Hasim, R. (2021). Differential Games for an Infinite 2-Systems of Differential Equations. Mathematics, 9(13), 1467. https://doi.org/10.3390/math9131467

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

Article Menu

Differential Games for an Infinite 2-Systems of Differential Equations

Abstract

1. Introduction

2. Motivation

3. Statement of Problem

4. Result

5. Guaranteed Evasion Time

6. Discussion

Author Contributions

Funding

Institutional Review Board Statement

Informed Consent Statement

Conflicts of Interest

References

Share and Cite

Article Metrics

Article Access Statistics

Further Information

Guidelines

MDPI Initiatives

Follow MDPI