发表机构
Bayero University, Kano; Federal Polytechnic Wannune; Federal University, Gashu’a; Kwantlen Polytechnic University（拜罗科大学; 联邦理工学院瓦努内; 加舒阿联邦大学; ）
机构由 AI 辅助整理，请以论文原文为准。AI 中文总结
该论文研究n维空间中受格朗沃尔型约束的一阶线性追逃微分对策，分析追击结果与参与者可达域的关系，并给出逃避可行的充分条件。
AI 中文摘要
我们研究了n维欧氏空间ℝⁿ中仅含一个追逃者的追逃问题，每个参与者的运动由一阶线性微分方程描述，其控制函数需满足格朗沃尔型不等式。对策持续时间为固定正值ϑ，当追逃者与逃避者的状态重合时，视为追击完成；若对策全程两者状态均不重合，则逃避可行。本文得到的追击问题相关结果依赖于两个参与者的可达域，同时给出了逃避可行的一个充分条件。
英文摘要
We examine pursuit and evasion problems in the space $ \mathbb{R}^{n} $ involving a lone pursuer and evader. Motion of each player is governed by a first-order linear differential equation. The players' control functions are subject to the Gronwall-type inequality. The game's duration is fixed and represented by a positive number $\vartheta $. When the state of a pursuer coincides with that of the evader, we then say the pursuit is completed. On the contrary, evasion is possible when throughout the game there is no agreement between the states of pursuer and evader. The result obtained related to the pursuit problem depends on the attainability domains of the two players. On the other hand, one sufficient condition is given for evasion to be possible.
