首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于改进粒子群优化的弹道并行求解算法
引用本文:邓方,崔静,方浩,李凤梅,郭素.基于改进粒子群优化的弹道并行求解算法[J].北京理工大学学报,2015,35(4):391-396.
作者姓名:邓方  崔静  方浩  李凤梅  郭素
作者单位:北京理工大学自动化学院,北京 100081;复杂系统智能控制与决策重点实验室,北京 100081;北京理工大学自动化学院,北京 100081;复杂系统智能控制与决策重点实验室,北京 100081;北京理工大学自动化学院,北京 100081;复杂系统智能控制与决策重点实验室,北京 100081;北京理工大学自动化学院,北京 100081;复杂系统智能控制与决策重点实验室,北京 100081;北京理工大学自动化学院,北京 100081;复杂系统智能控制与决策重点实验室,北京 100081
基金项目:国家自然科学基金资助项目(61304254)
摘    要:弹道解算精度与解算时间直接影响了火控系统的整体性能,然而精度与时间往往是相互矛盾的两个因素,在不损失精度的情况下提高解算速度具有重要意义. 基于改进粒子群优化的弹道并行求解算法,采用并行求解算法充分发挥多核计算机的性能,从而在不损失精度的前提下有效地提高了弹道解算的效率. 该方法首先通过引入粒子群优化算法将弹道解算转化为一个寻优过程,利用周氏迭代修正公式计算得到的修正角度引导粒子群更新加快算法的收敛速度;然后通过将粒子分配到并行域的线程中将弹道解算方法并行化. 数值实验表明本方法可以有效提高弹道解算的收敛速度,将计算时间平均缩短为原有时间的1/5. 

关 键 词:弹道解算  粒子群  并行计算
收稿时间:6/3/2013 12:00:00 AM

A Parallel Method of Ballistic Based on the Improved Particle Swarm Optimization Algorithm
DENG Fang,CUI Jing,FANG Hao,LI Feng-mei and GUO Su.A Parallel Method of Ballistic Based on the Improved Particle Swarm Optimization Algorithm[J].Journal of Beijing Institute of Technology(Natural Science Edition),2015,35(4):391-396.
Authors:DENG Fang  CUI Jing  FANG Hao  LI Feng-mei and GUO Su
Institution:School of Automation, Beijing Institute of Technology, Beijing 100081, China;Key Laboratory of Intelligent Control and Decision of Complex Systems, Beijing 100081, China
Abstract:The calculation accuracy and execution time which directly impact on the performance of a fire control system, are contradict each other. Therefore, it is significant to shorten the time of resolving algorithm of ballistic equations without decrease the precision. The parallel method of ballistic based on the improved particle swarm optimization algorithm is able to make good use of a multi-core computer by adopting concurrent computation. Firstly, the process of resolving ballistic equations was translated into a process of optimization by introducing the particle swarm optimization method. In order to improve the rate of convergence, the correction angle obtained through Zhou's iterative correction formula was used to guide the update of particles. Then the parallel method was gained through distributing each particle to threads in parallel domain. Finally, the results of practical calculation examples show this method can efficiently improve the rate of convergence and reduce the average time to one fifth.
Keywords:ballistic resolving algorithm  particle swarm optimization  parallel computing
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《北京理工大学学报》浏览原始摘要信息
点击此处可从《北京理工大学学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号