Cooperative multiple target assignment of submunitions based on Chaos-PSO algorithm

In this paper Multi-Objective particle swarm optimization (MOPSO) algorithm is utilized to solve the problem for cooperative multiple target assignment, which is the optimization problem in the discrete search space. At first a model of multi-objective optimization for Cooperative Multiple Target Assignment is established. Aiming to solve out the local convergence phenomenon, the chaos mutation is introduced into PSO for improving global optimal ability. Another underlying problem is that computing speed of the algorithm must meet the operational requirement, so a new kind of Chaos-MOPSO Algorithm is developed to solve the target assignment problem with less population and iterations. At last an authentication example is given in this paper, compared with basic MOPSO and NSGA-II, the Chaos-MOPSO algorithm obtained a better Pareto solution set with smaller computational burden.