Learning Evasive Maneuvers Using Genetic-Annealing Algorithms

To the problem of evasive maneuver games in the vertical plane, a kind of evasive maneuver games based on genetic-annealing algorithms is presented in this paper. The algorithm combining genetic algorithms with simulated annealing algorithms is named as a genetic-annealing algorithm, which can solve the problems of global optimal searching in a large state space and evaluation problems. The research also provides a new approach for solving complex decision making problems. Simulation results show that the evasive maneuver game based on the genetic-annealing algorithm can effectively realize evasive maneuvers and evade the rival´s interception