<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta>
      <journal-title-group>
        <journal-title>Mech.</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Group  Pursuit  Problem  for  Fraction  Differential  Systems  with  Pure Delay </article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Lesia Baranovska</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Vadym Mukhin</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Igor Sikorsky Kyiv Polytechnic Institute</institution>
          ,
          <addr-line>Prospect Beresteiskyi, 37, Kyiv, 03056</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2005</year>
      </pub-date>
      <volume>41</volume>
      <issue>2</issue>
      <fpage>210</fpage>
      <lpage>221</lpage>
      <abstract>
        <p>  In this paper, we consider for the first time the group problem of pursuit for linear fractional differential systems with several pursuers and one evader and with pure delay. We have developer an outline of the Method of Resolving Functions and the First Direct Method of Pontryagin for such conflict-controlled processes using the latest representation of the Cauchy formula. We compare the game end times guaranteed by these two methods. Sufficient conditions for ending the group pursuit game and the practical finding method of resolving functions are formulated.</p>
      </abstract>
      <kwd-group>
        <kwd> 1  Conflict-controlled process</kwd>
        <kwd>differential games</kwd>
        <kwd>fractional differential equations</kwd>
        <kwd>pursuit games</kwd>
        <kwd>group games</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction </title>
      <p>functions are typically determined from specific quadratic equations, making this technique a
convenient and universal means of solving certain problems.</p>
      <p>Delay differential equations are widely used in various fields, including control theory,
computer engineering, signal analysis, and damage theory. Generally, these mathematical
models have a peculiarity, which is that the rate of change of these processes is determined by
their history. In 2003, Khusainov, Shuklin, and Pospíšil [7-9] represented the solutions of linear
differential equations, proposing to consider the so-called exponential matrix function with a
delay. Based on the presented analogs of the Cauchy formula for conflict-controlled processes
described by differential-difference systems, sufficient conditions for solving pursuit games
have been found in research papers [10, 11]. The work [12] presents a modification of the
Method of Resolving Functions for differential-difference pursuit games for a group of
pursuers and one evader.</p>
      <p>Representations of solutions of fractional differential equations with a linear delay are
increasingly considered. Li and Wang considered a representation of the solution of the linear
homogeneous fractional differential systems with the pure delay with order  ∈
delayed matrix Mittag-Leffler functions [13]. The basic studies by Chikry–Eidelman [14-19]
using
contain sufficient conditions for solving the pursuit problem for systems with fractional
derivatives of arbitrary order  ∈</p>
      <p>0, 1 .</p>
      <p>In 2018, Liang et al [20] presented the solution of the linear homogeneous fractional
differential system with the pure delay with a term that includes Caputo double derivatives
with order  ∈</p>
      <p>0, 1 . In 2021, Liu et al [21] obtained exact solutions for a nonhomogeneous
fractional oscillation equation with pure delay by constructing two functions derived from the
extension of the Mittag-Leffler function.</p>
      <p>In 2021, Elshenhab and Wang [22] introduced a new delay matrix of the Mittag–Leffler
type with two Liu delay matrices. This study is based on the latest achievements in the
presentation of analogs of the Cauchy formula.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Preliminaries </title>
      <p>In this section, we present some necessary definitions and lemmas for linear fractional
systems with pure delay used in our subsequent discussions.</p>
      <p>Consider the system
where 
zero, 
 
where 



constant real nonzero matrix, : 0, ∞ → ℝ
be a given function,
denotes the Caputo fractional derivative of order  ∈
is a solution satisfying (1) for every  0,</p>
      <p>A is an
with the initial conditions
 
≡   ,
 ,
ℎ  0,
Definition 1. [22]. The two-parameter Mittag-Leffler function is defined as
 ,  , … , 
: ℎ, ∞ → ℝ
is an arbitrary differentiable function.</p>
      <p>(1)
Especially, if  1,
then
 ,
 ,</p>
      <p>and  ,</p>
      <p>are defined as follows:
Definition 2. [22]. The delayed Mittag-Leffler type matrix functions  ,

,  ,

 ≡</p>
      <p>Γ</p>
      <p>, ,  0,  ∈ ℂ.
Γ 1</p>
      <p>,  0.
Let</p>
      <p>be a solution of the system (2) under the initial condition
vector functions of its variables;</p>
      <p>and V are nonempty compacts.
where 
are square matrices of order  ;   ,  ,  : 
 → ℝ
, are jointly continuous
 
≡ 
 ,  
≡ 
 , ℎ
 0,  1, 2, . . . , .</p>
      <sec id="sec-2-1">
        <title>The terminal set  ∗ consists of sets  ∗, … ,  ∗</title>
        <p>,  ∗ ⊂ ℝ , each having the form
3. Problem statement </p>
      </sec>
      <sec id="sec-2-2">
        <title>Let the motion of an object</title>
        <p>,  ∈ ℝ , evolve in a finite-dimensional
where 
complement</p>
        <sec id="sec-2-2-1">
          <title>Denote [4].</title>
        </sec>
        <sec id="sec-2-2-2">
          <title>The function</title>
          <p>is a linear subspace in ℝ
to subspace 
in the space ℝ .</p>
          <p>is a convex compact belonging to the orthogonal
The valid controls  and  are the measurable Lebesgue functions,  ∈ 
and  ∈  .
Ω
Ω
  :  
  :  
∈  ,  ∈</p>
          <p>0, ∞
∈ ,  ∈
0, ∞
.</p>
          <p>,
The function ∙ )∈ Ω is chosen by the evader based on knowledge of the initial condition
  :  ∙ ∈ Ω ,  ∈ 0, 
,
is the prehistory of the control of evader 4.
each moment  0, 
 

and condition 3 it assigns 4 a Lebesgue measurable functio
n</p>
          <p>The group pursuit game (2), (3) terminates when  ∈  ∗ for some i.
4. Scheme of the Method of the Resolving Functions 
maps</p>
          <p>Denote by  the operator of orthogonal projection from ℝ onto  . Consider the set-valued
Condition 1.   ∅</p>
          <p>for all  1, 2, . . . , ,  0.</p>
          <p>Since 

0, ∞</p>
          <p>the set-valued map  
them has a Borelian selection   [24]. Let us denote ∙ 
 ∙ :   ∈ 
 ,  0,  1, … ,</p>
          <p>. For fixed g∙ ∈ 
 
⋯ 
  ℎ
subject to the equations

 ,   ,  1, 2, . . . , ,
for  0, ℎ</p>
          <p>0,
is upper semicontinuous and each of</p>
          <p>and 
we put
∙</p>
          <p>ℎ





Consider the resolving function
(4)
(5)
(6)
and</p>
          <p>,




0 
assumes finite values.
for all  ∈
0,  ,  ∈ ,
if and
. If for some  0
T ( (), g())  inf t  0 : inf max t inf  i (t, s,v)ds  1, i  1,..., ,</p>
          <p>vV i 0 vV
 ∙</p>
        </sec>
      </sec>
      <sec id="sec-2-3">
        <title>If the inequality in the curly brackets does not hold for all  0, we put</title>
        <p>Theorem. Let the conflict-controlled process (2) and (4) with the initial condition (3) satisfy</p>
      </sec>
      <sec id="sec-2-4">
        <title>Condition 1. Let coM</title>
        <p>Borelian selection  ∙ ∈ 
,  1, … , 
, and let for given  ∙</p>
        <p>Then for at least one i a trajectory of the corresponding process (2) can be brought from
 ∙ to the set  ∗ at the moment 
introduce the controlling function
ℎ 
ℎ, , 
∙ ,  ∙ ,</p>
        <p>∙
1
min
,…,

, , 
∙ ,   , 
∙ ,  0.
controlling function becomes zero:</p>
      </sec>
      <sec id="sec-2-5">
        <title>From the definition of T, there is a switching time  ∗  ∗</title>
        <p>∙ , 0 
∗ ,
such that the
At the same time, we can assign arbitrary control to all other pursuers.</p>
        <p>If  , 
 ∗

∗
on the interval 0,  ∗ equals to
and it is a Borelian function [25].
0.

appear as a jointly Borelian function in their variables [25]. The control of each of the pursuers
lexmin
,  1, … , ,</p>
      </sec>
      <sec id="sec-2-6">
        <title>From (7) it follows that there exists a number  ∗, such that</title>
        <p>1
∗
pursuer equal to
∈  :  
, 
 ℎ
∗ ∙ ,   ,  ∗ ∙ ≡ 0 on the interval  ∗,  , and the control of the  ∗-th


 , ,</p>
      </sec>
      <sec id="sec-2-7">
        <title>Let us examine the case when  ,</title>
        <p>the  ∗ pursuer. Since  ∗ , , 
that</p>
        <p>From the Cauchy formula (Lemma 1) for the  ∗ pursuer we have
If we add and subtract from the right-hand side of (14) the value
 ∗ 
, we obtain
Then


∗


∗</p>
        <p>∗

∗
∗, 


∗ ∗ 
 ∗

∗</p>
        <p>, .
∗ 0 
∗</p>
        <p>∗, 
  
∗
∗
∗</p>
        <p>∗


∗ ∗ 
∗

∗
∗, 
∗, 
∗,</p>
        <p>∗ ℎ
∗ 2ℎ
∗ ℎ
∗ 
∗</p>
        <p>where  is a geometric subtraction of the sets (Minkowski’s difference) [26-29].
 
∗ ℎ
∗ ℎ
∗ ℎ
∗ , 
 ∗

.</p>
        <p>∗
,
∗ 
Taking the pursuer's control choice laws (8), (9), (11), (12) into account we deduce the
inclusion
 ∗ ∗

∈  ∗ , 
∗ ∙ ,  ∗ ∙ 
∗ , , 

∗
∗ ∙ ,  ∗ ∙
complete.</p>
        <p>Remark. For the linear process (2)
 ∗ ∗

∈  ∗ , 
∗ ∙ ,  ∗ ∙
1 
∗ , , 
∗ , , 
 ∗
 .</p>
        <p>Since (13) and the set  ∗
is convex then  ∗ ∗ ∈ 
∗
.</p>
        <p>If for some i  ,</p>
        <p>, then, because of the control choice law, in this case,
formula (5), and Lemma 1, we infer the inclusion   
∈  . The proof is therefore
 
1 is fulfilled, and let there exist continuous positive functions   , and nonnegative numbers
where  is a unit ball centered at zero in the subspace  .
to be the largest roots of the quadratic equations for  , 
0,
Then when  , 
∙ ,  ∙ ∉ 
, the resolving functions  , , 
∙ are the maximal numbers  such that
 
∩   
 ,   ℎ
,</p>
        <p>ℎ
 
,   ℎ

0 
,   ℎ

0</p>
        <p>ℎ</p>
        <p>∈   ℎ
(15)
(16)
(17)</p>
        <p>,   ℎ
,   2ℎ

0 
   ∈
 ℎ</p>
        <p>,  1, … , .
5. Scheme of the First Direct Method of Pontryagin  </p>
        <sec id="sec-2-7-1">
          <title>Denote the Pontryagin function Let us prove that the quantity (17) is the guaranteed moment when the i-th pursuer catches the evader, i.e., it is the end of the pursuit game by the First Direct Method of Pontryagin [23].</title>
          <p>Since the left part of inclusion (16) is linear in  , the vector
lies on the boundary of the sphere   ℎ
 
for the maximal value of 
for
each  1, … , .
each  1, … , ,</p>
          <p>In other words, the length of this vector is equal to the radius of this ball for
which is demonstrated by (15). The proof is complete.
terminal set  ∗ at the moment .</p>
          <p>Proof. We shall follow the i-th pursuer. The following inclusion holds
Theorem 2. Let the process (2), (4) with the initial condition (3) satisfy Condition 1, and for
the given initial state 
∙</p>
          <p>∙ is determined by the equality (17).</p>
          <p>Then for at least one i a trajectory of the process (2)-(4) can be brought from  ∙ to the
 ℎ

 .</p>
          <p>Hence, there exists a point 
and a selector  ∙ ∈ 
 
0</p>
        </sec>
        <sec id="sec-2-7-2">
          <title>Consider the set-valued maps</title>
          <p>, 
where  ∈</p>
          <p>0; P ,  ∈ .
are Borel measurable functions in s, v.</p>
        </sec>
        <sec id="sec-2-7-3">
          <title>We set the control of i-th pursuer equal to They are Borel measurable functions in s, v. The selections</title>
          <p>where   ,  
  
∈ ,

is a measurable function. Under (18) and (17), we obtain
,   ℎ

0 
 
,   ℎ
0</p>
          <p>,   ℎ
holds if and only if there exists a selector g ∙ ∈ G
such that  , 
.</p>
          <p>Proof. Let
 
 
 ,</p>
        </sec>
      </sec>
      <sec id="sec-2-8">
        <title>Finally, we have the inclusion</title>
        <p>∈  ∗. The proof is complete.</p>
        <p>Theorem 3. Let the conflict-controlled process (2), and (4) with the initial condition (3) satisfy</p>
        <sec id="sec-2-8-1">
          <title>Condition 1. Then the inclusion</title>
          <p>Then there exists a point 
and a selection g ∙ ∈ G
 
0 

reverse order, we will get the desired result.</p>
          <p>Then for at least one i and initial state (3), there exists a selection g ∙ ∈ G
, then reasoning in the</p>
        </sec>
      </sec>
      <sec id="sec-2-9">
        <title>Remark. In the case when the resolving function , ,</title>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>6. Conclusions </title>
      <p>presented.</p>
    </sec>
    <sec id="sec-4">
      <title>7. References </title>
      <p>This paper elaborates the results obtained in previous research [30] and focuses on group
pursuit games, which are described by fractional differential systems with pure delay. We
construct outlines of the Method of Resolving Functions and the First Direct Method of
Pontryagin using an analog of the Cauchy formula for these systems, and formulate sufficient
conditions for the ending of the game. The game end times guaranteed by these two methods
are comparable. The method of practical implementation of the resolving functions is</p>
      <p>In the future, it is planned to develop outlines of Methods of Resolving Functions and the
First Direct Method of Pontryagin for processes described by linear fractional systems with
multiple delays given by commutative and noncommutative matrices.
[1] R. Isaacs, Differential Games, John Wiley, New York, NY, 1965.
[2] L. S. Pontryagin, Selected scientific papers, 2nd. ed., Nauka, Moscow, 1988.
[3] B. Pschenitchnyi, Linear Differential Games, Automat. Remote Control. 1 (1968) 65–78. URL:
[4] A. A. Chikrii, Conflict controlled processes, Boston; London; Dordrecht, Springer Science, and</p>
      <p>Business Media, 2013. URL: https://link.springer.com/book/10.1007/978-94-017-1135-7.
[5] L. V. Baranovskaya, A. A. Chikrij, Al. A. Chikrij, Inverse Minkowski functional in a nonstationary
problem of group pursuit, Izvestiya Akademii Nauk. Teoriya i Sistemy Upravleniya. 1 (1997) 109–
URL:</p>
      <p>https://www.scopus.com/record/display.uri?eid=2-s2.0114.
101–106.</p>
      <p>0030622746&amp;origin=resultslist&amp;sort=plf-f.
[6] L. V. Baranovskaya, A. A. Chikrii, Al. A. Chikrii, Inverse Minkowski functional in a nonstationary
problem of group pursuit, Journal of Computer and Systems Sciences International. 36(1) (1997)
URL:</p>
      <p>https://www.scopus.com/record/display.uri?eid=2-s2.0[7] D. Ya Khusainov, G. V. Shuklin, Relative controllability in systems with pure delay, Int. Appl.
[8] M. Pospíšil, Representation of solutions of systems of linear differential equations with multiple
delays and nonpermutable variable coefficients, Mathematical Modeling and Analysis. 25(2)
(2020) 303–322. doi:10.3846/mma.2020.11194.
[9] M. Pospíšil, F. Jaroš, On the representation of solutions of delayed differential equations via
Laplace transform, Electronic Journal of Qualitative Theory of Differential Equations. 117 (2016).
1–13. doi:10.14232/ejqtde.2016.1.117.
[10] L. V. Baranovska, Quasi-linear differential-difference game of approach, Understanding Complex</p>
      <p>Systems. (2019) 505–524. doi:10.1007/978-3-319-96755-4_26.
[11] L. V. Baranovska, Pursuit differential-difference games with pure time-lag, Discrete and</p>
      <p>Continuous Dynamical Systems – B. 24(3) (2019) 1021–1031. doi:10.3934/dcdsb.2019004.
[12] L. V. Baranovska, Group pursuit differential games with pure time-lag, Understanding Complex</p>
      <p>System. (2021) 475–488. doi:10.1007/978-3-030-50302-4_23.
[13] M. Li, J. R. Wang, Finite-time stability of fractional delay differential equations, Appl. Math. Lett.</p>
      <p>64 (2017) 170–176. doi:10.1016/j.aml.2016.09.004.
[14] A. A. Chikrii, S. D. Eidelman, Game problems for fractional quasilinear systems, Computers, and</p>
      <p>Mathematics with Applications. 44(7) (2002) 835–851. doi:10.1016/S0898-1221(02)00197-9.
[15] A. A. Chikrij, S. D. Ejdel'man, Game problems of control for quasilinear systems with fractional
Riemann-Liouville derivatives, Kibernetika i Sistemnyj Analiz. 6 (2001) 66–99. URL:
http://www.kibernetika.org/ContentsUA.html.
[16] A. A. Chikrii, I. I. Matichin, Game problems for fractional-order linear systems, in Proceedings of
the Steklov Institute of Mathematics, 2010, pp. S54–S70. doi:10.1134/S0081543810050056.
[17] A. A. Chikrij, S. D. Ejdel'man, Generalized Mittag-Leffler matrix functions in game problems for
evolution equations of fractional order, Kibernetika i Sistemnyj Analiz. 3 (2000) 3–32. URL:
http://www.kibernetika.org/ContentsUA.html.
[18] A. A. Chikrii, S. D. Eidelman, Generalized Mittag–Leffler matrix functions in game problems for
evolutionary equations of fractional order, Cybernetics and Systems Analysis. 36(3) (2000) 315–
338. doi:10.1007/BF02732983.
[19] A. Chikrii, I. Matychyn, Riemann–Liouville, Сaputo, and sequential fractional derivatives in
differential games, Annals of the International Society of Dynamic Games. 11 (2011) 61–
81. doi:10.1007/978-0-8176-8089-3_4.
[20] C. Liang, J. R. Wang, D. O'Regan, Representation of solution of a fractional linear system with
pure delay, Appl. Math. Lett. 77 (2018) 72–78. doi:10.1016/j.aml.2017.09.015.
[21] L. Liu, Q. Dong, G. Li, Exact solutions and Hyers–Ulam stability for fractional oscillation
equations with pure delay, Appl. Math. Lett. 112 (2021) 1–7. doi:10.1016/j.aml.2020.106666.
[22] Ahmed M. Elshenhab, Xing Tao Wang, Representation of solution for linear fractional systems
with pure delay and multiple delays, Mathematical Methods in the Applied Sciences. 44 (2021)
12835–12850. doi:10.1002/mma.7585.
[23] N. N. Krasovskii, A. J. Subbotin, Positional Differential Games, Nauka, Moscow, 1974.
[24] A. D. Joffe, V. P. Tikhomirov, Theory of External Problems. North-Holland, Amsterdam, 1979.
[25] J.-P. Aubin, H. Frankowska, Set-valued analysis, Boston, Basel, Berlin: Birkhauser, 1990. URL:
https://link.springer.com/book/10.1007/978-0-8176-4848-0.
[26] B. N. Pshenitchnyi, Convex Analysis and Extremal Problems, Nauka, Moscow, 1980.
[27] I. I. Kryvonos, A. A. Chikrii, K. A. Chikrii, On an approach scheme in nonstationary game
problems, Journal of Automation and Information Sciences. 45(8) (2013) 32–40.
doi:10.1615/JAutomatInfScien.v45.i8.40.
[28] G. T. Chikrii, On one problem of approach for damped oscillations, Journal of Automation and</p>
      <p>Information Sciences. 41(10) (2009) 1–9. doi:10.1615/JAutomatInfScien.v41.i10.10.
[29] A. O. Chikrii, G. T. Chikrii, Matrix resolving functions in dynamic games of
approach, Cybernetics and Systems Analysis. 50(2) (2014) 201–217.
doi:10.1007/s10559-0149607-7.
[30] L. V. Baranovska, Pursuit Problem for Fractional Differential Systems with Pure
Delay, Cybernetics and Systems Analysis. 58 (2022) 409–416. doi:10.1007/s10559-022-00473-y.</p>
    </sec>
  </body>
  <back>
    <ref-list />
  </back>
</article>