Application of Improved Dynamic Search Method Based on Greedy Strategy in Weapon Target Assignment
The optimization theory in mathematics is a common means to solve the problem of distribution management.In or-der to get the best benefit,the allocation optimization model of weapon targets in strategy is usually established.When building many models,the cost is often high,so it is often divided into several processes to solve.In the traditional algorithm design,the more prominent is dynamic programming,which is a multi-stage decision-making problem.This paper analyzes the mathematical background of weapon target allocation and the application strategy of optimization theory,and analyzes the application of the actual solution process of dynamic programming and other strategies to the problem of weapon equipment allocation.An improved dynamic search method based on greedy strategy is proposed.This method has significantly improved the efficiency of finding accurate values compared with dynamic programming method when the processing scale is fixed.It has good reference value in the algorithm design of combat software.
resource allocationweapon target allocationdynamic planninggreedy law
国家科技期刊平台
NSTL
万方数据
