TY - JOUR
T1 - Ballistic method based on improved particle swarm optimization algorithm
AU - Cui, Jing
AU - Deng, Fang
AU - Fang, Hao
PY - 2013/7
Y1 - 2013/7
N2 - In order to improve real-time performance of the fire control system, a ballistic resolving method based on the improved particle swarm optimization (PSO) algorithm is proposed, which improves the response speed of the system and provides a convenient extension to parallel computing on multicore platforms. First, particles are generated and initialized around the pre-estimated aiming angle. Then each particle is evaluated by an objective function composed of the ballistic differential equation etc. Finally, the position and velocity of particle swarm are updated. In order to accelerate the convergence speed, the correction angle of the global best particle obtained by Zhou's iterative and correction formula is used to guide the update of particle swarm. Experimental results show that the calculation speed is twice that of the iterative and correction method, and the convergence speed of particle swarm is 1.5 times that of the conventional PSO algorithm. Moreover, the proposed method is fully compatible with parallel computing and can further shorten execution time on multicore platforms.
AB - In order to improve real-time performance of the fire control system, a ballistic resolving method based on the improved particle swarm optimization (PSO) algorithm is proposed, which improves the response speed of the system and provides a convenient extension to parallel computing on multicore platforms. First, particles are generated and initialized around the pre-estimated aiming angle. Then each particle is evaluated by an objective function composed of the ballistic differential equation etc. Finally, the position and velocity of particle swarm are updated. In order to accelerate the convergence speed, the correction angle of the global best particle obtained by Zhou's iterative and correction formula is used to guide the update of particle swarm. Experimental results show that the calculation speed is twice that of the iterative and correction method, and the convergence speed of particle swarm is 1.5 times that of the conventional PSO algorithm. Moreover, the proposed method is fully compatible with parallel computing and can further shorten execution time on multicore platforms.
KW - Ballistic resolving algorithm
KW - Iterative correction
KW - Particle swarm optimization
UR - http://www.scopus.com/inward/record.url?scp=84886239757&partnerID=8YFLogxK
U2 - 10.3969/j.issn.1001-0505.2013.S1.045
DO - 10.3969/j.issn.1001-0505.2013.S1.045
M3 - Article
AN - SCOPUS:84886239757
SN - 1001-0505
VL - 43
SP - 215
EP - 218
JO - Dongnan Daxue Xuebao (Ziran Kexue Ban)/Journal of Southeast University (Natural Science Edition)
JF - Dongnan Daxue Xuebao (Ziran Kexue Ban)/Journal of Southeast University (Natural Science Edition)
IS - SUPPL.I
ER -