Share Email Print

Proceedings Paper

Cooperative multiple target assignment of submunitions based on Chaos-PSO algorithm
Author(s): Xuzhong Wu; Shengjing Tang; Jiao Shi
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

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.

Paper Details

Date Published: 28 October 2011
PDF: 6 pages
Proc. SPIE 8205, 2011 International Conference on Photonics, 3D-Imaging, and Visualization, 82052L (28 October 2011); doi: 10.1117/12.906116
Show Author Affiliations
Xuzhong Wu, Beijing Institute of Technology (China)
Shengjing Tang, Beijing Institute of Technology (China)
Jiao Shi, Beijing Institute of Technology (China)

Published in SPIE Proceedings Vol. 8205:
2011 International Conference on Photonics, 3D-Imaging, and Visualization
Egui Zhu, Editor(s)

© SPIE. Terms of Use
Back to Top