Generalized target-radar assignment using genetic algorithm

This paper presents a generalized target-radar assignment problem in cooperative air combat. Consider a scenario where multiple airborne radars are assigned to track multiple targets to maximize the elimination of the threat value of the targets. In order to achieve the guidance of the missiles simultaneously, the targets are generalized to comprise the enemy targets and the missiles which are launched to attack these targets. This combinational optimization problem is NP-hard. To improve the search efficiency, the genetic algorithm (GA) is used for solving this problem. The performance of GA is compared with the random search algorithm. The comparison results indicate that GA can converge to good feasible solutions in more reasonable time.