Optimal Fighter Pursuit-Evasion Maneuvers Found via Two-Sided Optimization
Optimal Fighter Pursuit-Evasion Maneuvers Found via Two-Sided Optimization
复制标题
DOI：
10.2514/1.3960
复制
发表时间：
2006
影响因子：
2.6
通讯作者：
Kazuhiro Horie;B. Conway
中科院分区：
文献类型：
--
作者：
Kazuhiro Horie;B. Conway
将战斗机的最优机动问题转化为微分对策问题，然后用最近发展起来的非线性规划半直接配点法求解。在这种方法中，一个玩家的最优控制是数值上找到的，也就是说，通过优化器，但另一个玩家是基于问题的分析必要条件。因为这需要一个参与者的协态变量，所以该方法不是直接方法。然而，该问题可以放置在常规配置的形式与非线性规划。因此，它被称为半直接方法。遗传算法用于为非线性规划问题求解器提供近似解，即初始猜测。将该方法应用于具有挑战性的战斗机三维最优追逃问题。所获得的最佳轨迹被确定为具有两个阶段：第一个快速变化，主要是在方向上，其次是一段时间的主要垂直机动。各种初始位置和速度的规避飞机相对于追求的解决方案被确定。
An optimal pursuit-evasion fighter maneuver is formulated as a differential game and then solved by a recently developed numerical method, semidirect collocation with nonlinear programming. In this method, the optimal control for one player is found numerically, that is, by the optimizer, but that for the other player is based on the analytical necessary conditions of the problem. Because this requires costate variables for one player, the method is not a direct method. However, the problem can be placed in the form of conventional collocation with nonlinear programming. Thus, it is referred to it as a semidirect method. A genetic algorithm is used to provide an approximate solution, an initial guess, for the nonlinear programming problem solver. The method is applied to the challenging problem of optimal fighter aircraft pursuit-evasion in three dimensions. The obtained optimal trajectories are identified as having two phases: first a rapid change, primarily in direction, followed by a period of primarily vertical maneuvering. Solutions for various initial positions and velocities of the evader aircraft with respect to the pursuer are determined.