Paper
28 October 2011 Cooperative multiple target assignment of submunitions based on Chaos-PSO algorithm
Xuzhong Wu, Shengjing Tang, Jiao Shi
Author Affiliations +
Proceedings Volume 8205, 2011 International Conference on Photonics, 3D-Imaging, and Visualization; 82052L (2011) https://doi.org/10.1117/12.906116
Event: 2011 International Conference on Photonics, 3D-imaging, and Visualization, 2011, Guangzhou, China
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.
© (2011) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Xuzhong Wu, Shengjing Tang, and Jiao Shi "Cooperative multiple target assignment of submunitions based on Chaos-PSO algorithm", Proc. SPIE 8205, 2011 International Conference on Photonics, 3D-Imaging, and Visualization, 82052L (28 October 2011); https://doi.org/10.1117/12.906116
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Detection and tracking algorithms

Particles

Particle swarm optimization

Algorithm development

Optimization (mathematics)

Chaos

Mathematical modeling

Back to Top