Multi-stage attack weapon target allocation method based on defense area analysis

For better reflecting the interactive defense between targets in practical combat scenarios,the basic weapon-target allocation(WTA)framework needs to be improved.A multi-stage attack WTA method is proposed.First,a defense area analysis is presented according to the targets’positions and the radii of the defense areas to analyze the interactive coverage and protection between targets’defense areas.Second,with the coverage status and coverage layer number,a multi-stage attack planning method is proposed and the multi-stage attack objective function model is established.Simulation is conducted with interactive defense combat scenarios,the traditional WTA method and the multi-stage WTA method are compared,and the objective function model is validated with the Monte-Carlo method.The results suggest that if the combat scenario involves interactive coverage of targets’defense areas,it is imperative to analyze the defense areas and apply the multi-stage attack method to weakening the target defense progressively for better combat effectiveness.

基于NSGA-Ⅱ的WTA多目标优化(英文)

将多目标遗传算法NSGA-(改进的非支配排序遗传算法)应用于求解武器-目标分配(WTA)问题。首先,针对以往在建立防空型WTA问题的优化模型上的片面性,把WTA问题看做多目标优化问题,建立了综合考虑作战效能和防御效能的WTA双目标优化模型。然后在此基础上,研究和应用了NSGA-来求解WTA问题。最后由仿真算例验证了NSGA-在WTA问题中的应用可行性,表明了NSGA-可以快速地搜索到WTA多目标优化的Pareto最优解集,从而为求解WTA问题提供了一条有效途径。

Dynamic WTA optimization model of air defense operation of warships' formation

WTA （weapon-target allocation） of air defense operation is a very complicated problem and current models focus on static and restricted WTA problem mostly. Based on the dynamic characteristics of air defense operational command and decision of warships＇ formation, a dynamic WTA model is established. Simulation results show that switch fire and repetition fire of anti-air weapon system affect the result of the air defense operation remarkably and the dynamic model is more satisfying than static ones. Related results are gained based on the analysis of the simulation results and the results are accordant with the intuitionistic tactical judgment. The model is some reference for the research of air defense C^3I system of warships＇ formation.

Self-adaptive learning based discrete differential evolution algorithm for solving CJWTA problem

Cooperative jamming weapon-target assignment （CJWTA） problem is a key issue in electronic countermeasures （ECM）. Some symbols which relevant to the CJWTA are defined firstly. Then, a formulation of jamming fitness is presented. Final y, a model of the CJWTA problem is constructed. In order to solve the CJWTA problem efficiently, a self-adaptive learning based discrete differential evolution （SLDDE） algorithm is proposed by introduc-ing a self-adaptive learning mechanism into the traditional discrete differential evolution algorithm. The SLDDE algorithm steers four candidate solution generation strategies simultaneously in the framework of the self-adaptive learning mechanism. Computa-tional simulations are conducted on ten test instances of CJWTA problem. The experimental results demonstrate that the proposed SLDDE algorithm not only can generate better results than only one strategy based discrete differential algorithms, but also outper-forms two algorithms which are proposed recently for the weapon-target assignment problems.

基于改进差分进化算法的跨平台武器目标分配方法

现代战争中,跨平台武器单元的协同利用,是合同编队体系的重要内容,作战方式也正由平台级协同向着能力要素级协同转变,这对武器目标分配问题的解决提出了更大挑战。本文将武器单元的最小划分单位细化到能力要素级,以毁伤概率与成本消耗为优化目标,面向多种来袭目标的编队防空场景,提出了跨平台武器目标分配算法。同时,基于混沌映射提出了混沌种群重构(chaotic population reconstruction,CPR)机制,并结合带存档的自适应差分进化(adaptive differential evolution with optional external archive,JADE)算法提出了CPR-JADE算法,利用CPR机制可以帮助算法在解决高维复杂约束问题时跳出局部最优。再将其运用到武器目标分配模型上,实现了对模型的高效求解。最后,通过在多种数据规模下与其他进化优化算法的仿真对比试验分析,验证了所提方法的正确性与有效性。

基于IDPSO的武器目标分配优化算法

针对武器目标分配(weapon-target allocation,WTA)优化问题的特点,对改进型离散粒子群(improve discrete particle swarm optimization,IDPSO)算法应用于WTA的若干问题进行研究。首先建立了资源受限条件下最大化效费比的WTA优化模型。然后,构建了一种针对多约束WTA问题的粒子编码方案,在此基础上,改进传统粒子群算法的位置和速度更新方式,提出了带怀疑因子和斥力因子的IDPSO算法。仿真实例表明,该算法具有更强的全局寻优能力和更快的收敛速度,能够有效求解大规模WTA问题,适应现代战争中辅助决策对实时性的要求。

基于改进BBO算法和模糊期望效果的反导武器目标分配建模与实现

针对现有反导武器目标分配(weapon target allocation,WTA)由于忽略射击有利度和目标意图价值的不确定特征,而造成目标错分、漏分的问题,引入模糊期望理论,构建基于模糊期望效果的最大化费效比反导WTA模型。针对模型特点,提出基于改进型生物地理优化(improved biogeography-based optimization,IBBO)算法。该算法采用基于整数的矩阵编码方式,通过余弦动态自适应策略改进迁移操作。同时,引入共生生物搜索(symbiotic organisms search,SOS)算法中相互作用思想,设计基于共生策略的变异操作。此外,在IBBO算法基础上结合模糊模拟形成混合智能算法,对模型进行求解。仿真实例表明,所提算法较好地协调了集约化和多样化的能力,提升了求解的精度与效率,满足不确定环境下反导辅助决策对求解精度和时效性的要求。

Firepower distribution method of anti-ship missile based on coupled path planning

Anti-ship missile coordinated attack mission planning is a complex multi-objective optimization problem with multiple combinations of platforms, strong decision-making constraints,and tightly coupled links. To avoid the coupling disorder between path planning and firepower distribution and improve the efficiency of coordinated attack mission planning, a firepower distribution model under the conditions of path planning is established from the perspective of decoupling optimization and the algorithm is implemented. First, we establish reference coordinate system of firepower distribution to clarify the reference direction of firepower distribution and divide the area of firepower distribution;then, we construct an index table of membership of firepower distribution to obtain alternative firepower distribution plans;finally, the fitness function of firepower distribution is established based on damage income, missile loss,ratio of efficiency and cost of firepower distribution, and the mean square deviation of the number of missiles used, and the alternatives are sorted to obtain the optimal firepower distribution plan. According to two simulation experiments, the method in this paper can effectively solve the many-to-many firepower distribution problem of coupled path planning. Under the premise of ensuring that no path crossing occurs, the optimal global solution can be obtained, and the operability and timeliness are good.

Weapon-target assignment in unreliable peer-to-peer architecture based on adapted artificial bee colony algorithm

It is of great significance for headquarters in warfare to address the weapon-target assignment(WTA)problem with distributed computing nodes to attack targets simultaneously from different weapon units.However,the computing nodes on the battlefield are vulnerable to be attacked and the communication environment is usually unreliable.To solve the WTA problems in unreliable environments,this paper proposes a scheme based on decentralized peer-to-peer architecture and adapted artificial bee colony(ABC)optimization algorithm.In the decentralized architecture,the peer computing node is distributed to each weapon units and the packet loss rate is used to simulate the unreliable communication environment.The decisions made in each peer node will be merged into the decision set to carry out the optimal decision in the decentralized system by adapted ABC algorithm.The experimental results demonstrate that the decentralized peer-to-peer architecture perform an extraordinary role in the unreliable communication environment.The proposed scheme preforms outstanding results of enemy residual value(ERV)with the packet loss rate in the range from 0 to 0.9.

多层防御模式下武器目标分配决策的群体智能优化算法

武器目标分配(WTA)是军事运筹学中经典的NP完全问题,迄今为止未找到求精确解的多项式时间算法.针对武器数量、布防空间、运行维护成本以及人力资源等多约束下的多层防御WTA问题,采用粒子群优化(PSO)和蚁群优化(ACO)两种群体智能算法求解.给出了PSO和ACO算法实现方案,通过一个算例评估两个算法的性能.结果表明,两种算法都能给出高质量的近似最优解,对求解WTA问题是有效的.PSO在解的质量、算法鲁棒性和计算效率方面均优于ACO.