运筹学学报(中英文) ›› 2025, Vol. 29 ›› Issue (4): 48-60.doi: 10.15960/j.cnki.issn.1007-6093.2025.04.004

• 论文 • 上一篇    下一篇

边界防御多人追逃微分博弈模型

苏昂1, 王磊1, 党志清1, 游志航1, 高红伟1,2,*()   

  1. 1. 青岛大学数学与统计学院, 山东青岛 266071
    2. 山东省应用数学研究所, 山东青岛 266071
  • 收稿日期:2021-12-01 出版日期:2025-12-15 发布日期:2025-12-11
  • 通讯作者: 高红伟 E-mail:gaohongwei@qdu.edu.cn
  • 基金资助:
    国家自然科学基金(72171126);青岛大学“系统科学+”联合攻关项目(XT2024301)

Multiplayer pursuit-evasion differential game model in border defense

Ang SU1, Lei WANG1, Zhiqing DANG1, Zhihang YOU1, Hongwei GAO1,2,*()   

  1. 1. School of Mathematics and Statistics, Qingdao University, Qingdao 266071, Shandong, China
    2. Institute of Applied Mathematics of Shandong, Qingdao 266071, Shandong, China
  • Received:2021-12-01 Online:2025-12-15 Published:2025-12-11
  • Contact: Hongwei GAO E-mail:gaohongwei@qdu.edu.cn

摘要:

保护边界安全一直以来是一个热点问题, 边界线形状的复杂多变增加了边界防御问题研究的复杂性。本文通过对边界防御场景的刻画, 将问题转化为追逃微分博弈问题, 进而求解出此博弈中局中人的最优策略, 并给出切实可行的算法。本文运用简单运动刻画局中人的运动, 运用二次曲线的一般方程形式刻画边界形状, 定义支付函数为捕获点到边界的距离。通过几何方法对问题进行研究, 得到了圆形边界情形下更加简洁的值函数形式, 并构造出局中人的最优策略。在圆形边界的基础上, 进一步得到针对二次曲线边界情形下的通用算法。最后对模型进行从定量到定性、从二维到三维、从多追一到多追多的完善, 并通过数值仿真验证了结论与算法的正确性。

关键词: 追逃微分博弈, 边界防御, 最优策略, 几何方法

Abstract:

Border security has always been a topic sparking intense debate. Moreover, border morphology realities separating countries are quite complex, exacerbating the complexity of border defence issues. As per relevant literature reviews, there is no perfect universal solution to address border defence problems, which makes it a matter of utmost concern. This paper aims to transform the problem into a pursuit-evasion differential game problem by delineating the border defence scenario. The method of differential game is subsequently used to solve the optimal strategy of the players, which ultimately yields a feasible algorithm. Specifically, this paper uses simple motion to describe player movement in the game, utilises the general equation form of the quadratic curve to demarcate the shape of the boundary, and defines the payoff function as the distance from the capture point to the boundary. The problem is studied by the geometric method, and a more concise value function form is yielded in the case of a circular boundary. The optimal strategy of the player in the game is ultimately constructed. A general algorithm for the quadratic curve boundary is further obtained based on the circular boundary. The model is then stretched from the game of degree to the game of kind, from two dimensions to three dimensions, from M-pursuers against a single evader to M-pursuers against N-evaders, and the result and algorithm are validated by using a numerical simulation.

Key words: pursuit-evasion differential game, border defense, optimal strategy, geometric method

中图分类号: