DocumentCode :
191018
Title :
An improved discrete Shuffled Frog Leaping Algorithm for cooperative Multi-Target assignment of BVR air combat
Author :
Deyun Zhou ; Qian Pan ; Kai Zhang
Author_Institution :
Sch. of Electron. & Inf., Northwestern Polytech. Univ., Xi´an, China
fYear :
2014
fDate :
5-8 Aug. 2014
Firstpage :
686
Lastpage :
691
Abstract :
Multi-Target assignment is an important tactical factor of BVR (Beyond Visual Range) air combat. Based on the analysis of the basic Shuffled Frog Leaping Algorithm (SFLA), an Improved Discrete Shuffled Frog Leaping Algorithm is proposed to solve the problem of multi-target assignment in BVR air combat. The threat evaluation function and the multi-target assignment model of BVR air combat are established. The new SFLA adopts adaptive Strategy of Evolution Capability Control to update the subpopulations, which can avoid trapping into local extremum. In order to improve population diversity and speed up the convergence, the Strategy of Difference Disturbance is proposed. Simulation results indicate that the Improved Discrete SFLA is feasible and more effective when compared with other algorithm in finding out the multi-target assignment scenario.
Keywords :
missile control; BVR air combat; SFLA; adaptive strategy of evolution capability control; air-to-air missiles; beyond visual range air combat; cooperative multitarget assignment model; improved discrete shuffled frog leaping algorithm; local extremum; strategy of difference disturbance; threat evaluation function; Atmospheric modeling; Azimuth; Bismuth; Missiles; Resource management; Sociology; Statistics; BVR air combat; Improved Discrete Shuffled Frog Leaping Algorithm; multi-target assignment; threat evaluation;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Signal Processing, Communications and Computing (ICSPCC), 2014 IEEE International Conference on
Conference_Location :
Guilin
Print_ISBN :
978-1-4799-5272-4
Type :
conf
DOI :
10.1109/ICSPCC.2014.6986283
Filename :
6986283
Link To Document :
بازگشت