Laser Antimissile System Strategy Optimization Based on Genetic Algorithm

Abstract

The attacking sequence optimization of laser antimissile system plays an important role in the real-time application. When faced with multiple attacking targets, it is clearly important for the laser antimissile system to determine the sequence of the attacking targets to be intercepted so that the maximum attacking targets are destroyed. Conceptually, this laser antimissile problem can be seen as a dynamical traveling salesman problem, which is much harder than a pure traveling salesman problem. In fact, it is a dynamical shortest path problem. But there are many barriers for finding the global optimal solution, especially when the number of the targets is greater than six. The dynamical inversion algorithm includes the inner flip and the outer flip; it partially solves the premature convergence problem. Finally, taking eight targets as an example, the simulation results show that the convergence of the algorithm is very fast and this achievement can be used in the real application.