Abstract
Dynamic weapon target assignment (DWTA) is an effective method to solve the multi-stage battlefield fire optimization problem, which can reflect the actual combat scenario better than static weapon target assignment (SWTA). In this paper, a meaningful and effective DWTA model is established, which contains two practical and conflicting objectives, namely, maximizing combat benefits and minimizing weapon costs. Moreover, the model contains limited resource constraints, feasibility constraints and fire transfer constraints. The existence of multi-objective and multi-constraint makes DWTA more complicated. To solve this problem, an improved multiobjective particle swarm optimization algorithm (IMOPSO) is proposed in this paper. Various learning strategies are adopted for the dominated and non-dominated solutions of the algorithm, so that the algorithm can learn and evolve in a targeted manner. In order to solve the problem that the algorithm is easy to fall into local optimum, this paper proposes a search strategy based on simulated binary crossover (SBX) and polynomial mutation (PM), which enables elitist information to be shared among external archive and enhances the exploratory capabilities of IMOPSO. In addition, a dynamic archive maintenance strategy is applied to improve the diversity of non-dominated solutions. Finally, this algorithm is compared with three state-of-the-art multiobjective optimization algorithms, including solving benchmark functions and DWTA model in this article. Experimental results show that IMOPSO has better convergence and distribution than the other three multiobjective optimization algorithms. IMOPSO has obvious advantages in solving multiobjective DWTA problems.
Highlights
In order to evaluate the improved multiobjective particle swarm optimization algorithm proposed in this paper, we conducted two sets of comparative experiments with three multiobjective optimization algorithms, i.e., IMOPSO, NSGA-II and MOEA/D
According to the experimental results of benchmark functions, the IMOPSO algorithm proposed in this paper has achieved the best values in all three evaluation indexes, which shows that the solutions obtained by IMOPSO in solving multiobjective optimization problem (MOP) have better convergence and distribution
The results of solving the multiobjective Dynamic weapon target assignment (DWTA) problem reflect the ability of IMOPSO in dealing with practical MOPs, which shows that IMOPSO algorithm is more suitable for solving large-scale mixed integer programming problems than other algorithms
Summary
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. Weapon target assignment (WTA) is a key issue of Command & Control (C2) [1]. Its goal is to strike enemy targets by rationally allocating weapon units, optimize the firepower strike system, and achieve the best strike effect. As an important subject of national defense-related applications, WTA has become a hot focus at present [2,3,4,5,6], attracting a large number of scholars to study, which has important military significance [7]. WTA has been proved to be NP-complete [8], and the amount of calculation for solving WTA increases exponentially with the increase of dimension.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
