<p>We study a simple motion multiple capture pursuit differential game of <i>m</i> pursuers <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11135_2025_2198_Article_IEq1.gif" Format="GIF" Height="12" Rendition="HTML" Resolution="72" Type="Linedraw" Width="91" /> </InlineMediaObject> <EquationSource Format="TEX">\(x_1, x_{2},..., x_{m}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>x</mi> <mn>1</mn> </msub> <mo>,</mo> <msub> <mi>x</mi> <mn>2</mn> </msub> <mo>,</mo> <mo>.</mo> <mo>.</mo> <mo>.</mo> <mo>,</mo> <msub> <mi>x</mi> <mi>m</mi> </msub> </mrow> </math></EquationSource> </InlineEquation> and one evader <i>y</i>. On the first <i>k</i> coordinates of the control function of each player a geometric constraint is imposed, and the other coordinates are subjected to an integral constraint. If <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11135_2025_2198_Article_IEq2.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="236" /> </InlineMediaObject> <EquationSource Format="TEX">\(x_{i_1}(\tau _1)=y(\tau _1),..., x_{i_d} (\tau _d)=y(\tau _d)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>x</mi> <msub> <mi>i</mi> <mn>1</mn> </msub> </msub> <mrow> <mo stretchy="false">(</mo> <msub> <mi>τ</mi> <mn>1</mn> </msub> <mo stretchy="false">)</mo> </mrow> <mo>=</mo> <mi>y</mi> <mrow> <mo stretchy="false">(</mo> <msub> <mi>τ</mi> <mn>1</mn> </msub> <mo stretchy="false">)</mo> </mrow> <mo>,</mo> <mo>.</mo> <mo>.</mo> <mo>.</mo> <mo>,</mo> <msub> <mi>x</mi> <msub> <mi>i</mi> <mi>d</mi> </msub> </msub> <mrow> <mo stretchy="false">(</mo> <msub> <mi>τ</mi> <mi>d</mi> </msub> <mo stretchy="false">)</mo> </mrow> <mo>=</mo> <mi>y</mi> <mrow> <mo stretchy="false">(</mo> <msub> <mi>τ</mi> <mi>d</mi> </msub> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> for some pairwise distinct numbers <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11135_2025_2198_Article_IEq3.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="184" /> </InlineMediaObject> <EquationSource Format="TEX">\(i_1, i_{2},..., i_d \in \left\{ 1, 2,..., m\right\}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>i</mi> <mn>1</mn> </msub> <mo>,</mo> <msub> <mi>i</mi> <mn>2</mn> </msub> <mo>,</mo> <mo>.</mo> <mo>.</mo> <mo>.</mo> <mo>,</mo> <msub> <mi>i</mi> <mi>d</mi> </msub> <mo>∈</mo> <mfenced close="}" open="{"> <mn>1</mn> <mo>,</mo> <mn>2</mn> <mo>,</mo> <mo>.</mo> <mo>.</mo> <mo>.</mo> <mo>,</mo> <mi>m</mi> </mfenced> </mrow> </math></EquationSource> </InlineEquation> and times <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11135_2025_2198_Article_IEq4.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="158" /> </InlineMediaObject> <EquationSource Format="TEX">\(0 &lt; \tau _1 \le \tau _{2} \le ...\le \tau _d\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mn>0</mn> <mo>&lt;</mo> <msub> <mi>τ</mi> <mn>1</mn> </msub> <mo>≤</mo> <msub> <mi>τ</mi> <mn>2</mn> </msub> <mo>≤</mo> <mo>.</mo> <mo>.</mo> <mo>.</mo> <mo>≤</mo> <msub> <mi>τ</mi> <mi>d</mi> </msub> </mrow> </math></EquationSource> </InlineEquation>, then we say that <i>d</i>-multiple capture occurs. We obtain a sufficient condition for multiple capture to occur and construct strategies for the pursuers.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Multiple capture in a differential game with mixed constraints on controls of players

  • Gafurjan Ibragimov,
  • Sarvinoz Kuchkarova,
  • Abdulla Ibragimov,
  • Bruno Antonio Pansera

摘要

We study a simple motion multiple capture pursuit differential game of m pursuers \(x_1, x_{2},..., x_{m}\) x 1 , x 2 , . . . , x m and one evader y. On the first k coordinates of the control function of each player a geometric constraint is imposed, and the other coordinates are subjected to an integral constraint. If \(x_{i_1}(\tau _1)=y(\tau _1),..., x_{i_d} (\tau _d)=y(\tau _d)\) x i 1 ( τ 1 ) = y ( τ 1 ) , . . . , x i d ( τ d ) = y ( τ d ) for some pairwise distinct numbers \(i_1, i_{2},..., i_d \in \left\{ 1, 2,..., m\right\}\) i 1 , i 2 , . . . , i d 1 , 2 , . . . , m and times \(0 < \tau _1 \le \tau _{2} \le ...\le \tau _d\) 0 < τ 1 τ 2 . . . τ d , then we say that d-multiple capture occurs. We obtain a sufficient condition for multiple capture to occur and construct strategies for the pursuers.