Abstract
Dogfight is often a continuous and multi-round process with missile attacks. If the fighter only considers the security when evading the incoming missile, it will easily lose the superiority in subsequent air combat. Therefore, it is necessary to maintain as much tactical superiority as possible while ensuring a successful evasion. The amalgamative tactical requirements of achieving multiple evasive objectives in a dogfight are taken into account in this paper. A method of generating a nondominated maneuver strategy set for evading missiles with tactical requirements is proposed. The tactical requirements include higher miss distance, less energy consumption, and higher terminal superiority. Then the evasion problem is defined and reformulated into a multi-objective optimization problem, which is solved by a redesigned multi-objective evolutionary algorithm based on decomposition (MOEA/D). Simulations are used to demonstrate the feasibility and effectiveness of the approach. A set of approximate Pareto-optimal solutions satisfying the tactical requirements are obtained. These solutions can not only guide the fighter to avoid being hit but also achieve the goal of relatively reducing energy consumption and improving terminal superiority.
Highlights
The core of operational idea in air combat is ‘‘Shoot down the opponent and protect yourself’’
The pilot can choose the appropriate maneuver strategy according to the tactical requirements in the current situation of a dogfight
Based on the above results of this experiment, compared with the classical multiobjective evolutionary algorithm based on decomposition (MOEA/D) and NSGA-II algorithms, the computational efficiency of the proposed algorithm is slightly lower than that of the MOEA/D, the approximate Pareto optimal solution set obtained by the redesigned MOEA/D is relatively optimal and the distribution is relatively uniform when solving the problem of evasive maneuver strategy set in this paper
Summary
The core of operational idea in air combat is ‘‘Shoot down the opponent and protect yourself’’. For optimal evasive maneuvers, the optimal support time of a missile and the dynamic-escapezone of a fighter were solved based on a differential game in [21] and [5], respectively. The literature mentioned above has given very reasonable results for the evasion problem, but evasive maneuvers of the fighter only considered the objective of security (i.e., miss distance) and ignored the effect of maneuvers on the attack mission It is well-known that dogfight is often a continuous and multi-round process with missile attacks. According to the aforementioned analysis, the problem of evasive maneuvers in a dogfight that involves several tactical requirements has a set of Pareto optimal solutions.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
