Abstract and Applied Analysis
Volume 2013, Issue 1 840925
Research Article
Open Access

Linear Discrete Pursuit Game Problem with Total Constraints

Atamurat Kuchkarov, 

Atamurat Kuchkarov

Institute of Mathematics of Uzbekistan, 29 Dorman yuli Street, 100125 Tashkent, Uzbekistan

Search for more papers by this author
Gafurjan Ibragimov, 

Corresponding Author

Gafurjan Ibragimov

Institute for Mathematical Research and Department of Mathematics, Faculty of Science (FS), Universiti Putra Malaysia, 43400 Serdang, Selangor, Malaysia upm.edu.my

Search for more papers by this author
Akmal Sotvoldiev, 

Akmal Sotvoldiev

Institute of Mathematics of Uzbekistan, 29 Dorman yuli Street, 100125 Tashkent, Uzbekistan

Search for more papers by this author
First published: 11 June 2013
https://doi.org/10.1155/2013/840925
Citations: 3
Academic Editor: Valery Y. Glizer

Abstract

We study a linear discrete pursuit game problem of one pursuer and one evader. Control vectors of the players are subjected to total constraints which are discrete analogs of the integral constraints. By definition pursuit can be completed in the game if there exists a strategy of the pursuer such that for any control of the evader the state of system z(t) reaches the origin at some time. We obtain sufficient conditions of completion of the game from any initial position of the state space. Strategy of the pursuer is defined as a function of the current state of system and value of control parameter of the evader.

1. Introduction

Pursuit and evasion differential game problems with integral constraints for continuous time dynamical systems were investigated in many works, (see, for example, [1–14]). Such constraints represent the constraints on resource, energy, fuel, and so forth. Discrete analog of integral constraint is called total constraint.

There are many works on discrete controlled systems where controls are subjected to total or geometric constraints. Sirotin [15] studied some conditions of 0-controllability and asymptotical controllability of discrete time linear systems. In this work, the control is bounded in Holder norm. In particular, he obtained necessary and sufficient conditions of 0-controllability and asymptotical controllability of the system.

Sazanova [16] studied the problem of steering the state of a linear discrete system from the given point at a given time to another given point at a given time by a control which minimizes a given functional. She constructed an optimal program control.

However, discrete linear pursuit games with total constraints on control vectors of players were studied in a few works, for example, [17–20]. Satimov et al. [19] examined linear discrete pursuit games of many objects under total constraints on controls of players. Game is described by the following systems:
()
It is assumed that the eigenvalues of matrices Ci are real. Sufficient conditions of completion of pursuit were obtained.

The paper of Satimov and Ibragimov [20] was also devoted to discrete time pursuit games of several players described by the same linear systems. They obtained sufficient conditions of completion of the game for any matrices Ci. It should be noted that in case of one pursuer these conditions are also necessary. In particular, they obtained necessary and sufficient conditions of 0-controllability when the coefficient matrix of control is an identity matrix.

Azamov and Kuchkarov [17] obtained necessary and sufficient conditions of solvability of both the 0-controllability problem and pursuit problem for a linear discrete system when the control parameter of pursuer is subjected to geometric constraint and that of evader is subjected to total constraint.

In the monograph of Azamov [21], the fundamentals of theory of discrete time pursuit and evasion dynamic games are given systematically. The main notions of the theory of discrete games were explained by interesting examples.

In the present paper, we study a linear discrete pursuit game problem described by the linear equation with constant coefficients of general form. Controls of both pursuer and evader are subjected to total constraints. We give sufficient conditions of completion of pursuit from any initial position.

2. Statement of the Problem

We consider a discrete pursuit game described by the following equation:
()
where t is a step number which belongs to the set of nonnegative integers, z(t) ∈ ℝn, A, B, and C are n × n, n × m, and n × l constant matrices, respectively, u ∈ ℝm is the control parameter of pursuer, and v ∈ ℝl is that of evader.

Definition 1. Sequences u(·) : N → ℝm and v(·) : N → ℝl, subjected to the following total constraints:

()
()
are referred to as the controls of the pursuer and evader, respectively, where N is the set of nonnegative integers, ρ > 0 and σ ≥ 0 are given numbers, and p > 1.

The conditions (3) and (4) are the discrete analogs of integral constraints, and they are called total constraints.

Definition 2. A function U(z, v),  U : ℝn  ×  ℝl → ℝm, is called strategy of the pursuer. The triple (z0, U, v(·)) consisting of a given initial point z0, the strategy U, and a control of the evader v(·) generates the unique trajectory z(t) defined by the following formula:

()
The sequence u(t) = U(z(t), v(t)), t ∈ N, is referred to as the realization of the strategy U. The strategy of the pursuer U is called admissible if all its realizations with fixed z0 satisfy the condition (3).

Definition 3. Pursuit is said to be completed in the game (2)–(4) from the initial position z0 if there exists a strategy of the pursuer U such that for any control of the evader v(·) the trajectory generated by z0, U, and v(·) satisfies the condition z(t) = 0 at some t, t ∈ N.

The aim of the pursuer is to realize the equality z(t) = 0 as earlier as possible. Thus we deal with pursuit problem. The pursuer uses a strategy, and the evader uses any control v(·). By Definition 2 at any time t the value of the strategy is constructed based on the state z(t) and value of the control parameter of the evader v(t).

Problem 1. Find the conditions under which pursuit can be completed in the game (2)–(4) from any initial position.

3. Main Result

To prove the main result, we first prove two lemmas. Let λ1, λ2, …, λn be the eigenvalues of the matrix A. Denote
()
Let V be the set of all sequences v(·) that satisfy the constraint (4).

Lemma 1. If β < 1, then

  • (a)

    for all t = 1,2, … the set

    ()

  •  

    is contained in a ball ;

  • (b)

    for any triple consisting of v(·) ∈ V, ε > 0, and t0 ∈ {0,1, 2, …} there exists a number t*, t* > t0, such that

    ()

Proof. Since β < 1, then ∥At∥ → 0 as t → ∞; therefore there exists a positive integer h, such that . Then according to the property of norm, we have

()

Clearly,

()
   Using the Holder inequality, we obtain for any v(·) ∈ V that
()
     It follows from (9)–(11) that
()
for all k = 1,2, …. Let r = aσ∥C∥(1 − μ) −1. It is easy to check that if 0 < t1 < t2, then X(t1) ⊂ X(t2). Therefore, the inequality (12) implies that
()
Since (12) holds for any positive integer k, then the statement (a) of Lemma 1 follows.

We now turn to the statement (b) of the lemma. Assume the contrary: there exist a control v(·) ∈ V and positive numbers ε, t0 such that

()
It follows from (9) that
()
Since 0 ≤ μ < 1, then we can conclude that there exists a positive integer T, T ≥ t0 + 1, such that
()
Clearly, (14) implies that
()
Setting j = i − T, we get
()
According to the part (a) of Lemma 1, this vector belongs to . Then by (16), I2 ≤ ε/2. Hence, from (17), we obtain that ε < I1 + (ε/2). Therefore, using the Holder inequality yields
()
where . This gives
()
Substituting j = (k + 1)T − 1 − i and then replacing j by i again, we obtain
()
We conclude from these inequalities that
()
According to (4) for any k, the left hand side of this inequality is bounded by σp, while the right hand side →∞ as k → ∞. Contradiction. The proof of Lemma 1 is complete.

Lemma 2. If β < 1, then for any v(·) ∈ V the solution z(·) = z(·, v(·), z0) of the system

()
satisfies the equality
()

Proof. Let v(·) ∈ V and ε be an arbitrary positive number. Since β < 1, then the system z(t + 1) = Az(t) is asymptotically stable. Therefore for any z0 there exists a number t1 such that

()

Next, by Lemma 1 there exists a number t2  (t2 ≥ t1) such that

()

Using (25) and (26), we have

()

As the number ε is arbitrary, then γ(z(t, v(·), z0)) = 0, and Lemma 2 follows.

Theorem 3. If β < 1 and , then pursuit can be completed in the game (2)–(4) from any initial position z0 ∈ ℝn.

Proof. Define the strategy of the pursuer as follows:

()

Since , the set contains a ball of radius δ > 0 of the space ℝn. It follows from Lemma 2 that for every control v(·) ∈ V there exists a step t ∈ N such that |Az(t) + Cv(t)| ≤ δ. Consequently, for some τ

()
Then by (28) we have BU(z(τ), v(τ)) = −Az(τ) − Cv(τ), and therefore
()
This proves the theorem.

We now give an illustrative example.

Example 4. Consider the following discrete system in ℝ2:

()
where z(t) ∈ ℝ2, u(t) = (u1(t), u2(t), u3(t)), and v(t) = (v1(t), v2(t), v3(t), v4(t)). Eigenvalues of the matrix
()
are λ1,2 = 0.3 ± 0.4i, and |λ1,2 | = 0.5 < 1. Next, it is not difficult to verify that , where
()
Thus, all hypotheses of Theorem 3 are satisfied, and therefore pursuit can be completed from any initial position z0 ∈ ℝ2.

4. Conclusion

In the present paper, we have studied a linear discrete pursuit game problem under total constraints. We have obtained conditions under which pursuit starting from any initial position can be completed in a finite number of steps. We have described a strategy for the pursuer which is constructed based on the information about the position z(t) and value of the control parameter of the evader v(t) at each step t. It should be noted that the resource of the pursuer ρ does not need to be greater than that of the evader σ.

Acknowledgment

The present research was partially supported by the National Fundamental Research Grant Scheme (FRGS) of Malaysia, 01-01-13-1228FR.

      The full text of this article hosted at iucr.org is unavailable due to technical difficulties.