Volume 37 Issue 10
Oct.  2011
Turn off MathJax
Article Contents
Sun Jian, Wu Sentang. Route planning of cruise missile based on improved particle swarm algorithm[J]. Journal of Beijing University of Aeronautics and Astronautics, 2011, 37(10): 1228-1232. doi: CNKI:11-2625/V.20111013.1436.008(in Chinese)
Citation: Sun Jian, Wu Sentang. Route planning of cruise missile based on improved particle swarm algorithm[J]. Journal of Beijing University of Aeronautics and Astronautics, 2011, 37(10): 1228-1232. doi: CNKI:11-2625/V.20111013.1436.008(in Chinese)

Route planning of cruise missile based on improved particle swarm algorithm

doi: CNKI:11-2625/V.20111013.1436.008
  • Received Date: 02 Jun 2010
  • Publish Date: 30 Oct 2011
  • Particle swarm optimization algorithm(PSO) is new type swarm intelligence algorithm after genetic algorithm and ant colony optimization algorithm,which is usually used in solving complex problems. Because its iterative formula is continuous, PSO is more suitable to solve route planning without grid. To the problem of premature frequently appeared in standard particle swarm optimization, improved particle swarm optimization (IPSO) algorithm was proposed. IPSO firstly selected elite particles and bad particles according to relevant cost function,updated velocity of bad particles according to kinetic energy loss of elite particles to avoid premature in search process. Secondly IPSO proposed velocity update strategy with failure experience of worst particles to let particles avoid bad result. Result which use IPSO in route planning of missile shows that, IPSO has better search capability in route planning application and receives smaller cost if iterations are same.

     

  • loading
  • [1] Eberhart R,Kennedy J.A new optimizer using particle swarm theory //Proceedings of the Sixth International Symposium on Micro Machine and Human Science.Nagoya Japan:MHS,1995:39-43 [2] Clerc M,Kennedy J.The particle swarm-explosion,stability and convergence in a multidimensional complex space[J].IEEE Transactions on Evolutionary Computation,2006,6(2):58-73 [3] Liang J J,Suganthan P N.Dynamic multi-swarm particle swarm optimizer //Swarm Intelligence Symposium.Pasadena California:IEEE,2005:124-129 [4] Andrews P S.An investigation into mutation operator for particle swarm optimization //IEEE Congress on Evolutionary Computation.Vancouver BC Canada:CEC,2006:1044-1051 [5] Olfati-Saber R.Flocking for multi-agent dynamic systems:algorithm and theory[J].IEEE Transaction on Automatic Control,2006,3(51):401-420 [6] Kennedy J,Eberhart R C.A discrete binary version of the particle swarm algorithm //IEEE Conference on Systems,Man and Cybernetics.Orlando FL:IEEE,1997:4104-4108 [7] Banks A,Vincent J,Anyakoha C.A review of particle swarm optimization-Part I:background and development[J].Natural Computing,2007,6(4):467-484 [8] 吴森堂,费玉华.飞行控制系统[M].北京:北京航空航天大学出版社,2005:248-251 Wu Sentang,Fei Yuhua.Flight control system[M].Beijing:Beijing University of Aeronautics and Astronautics Press,2005:248-251(in Chinese) [9] 穆晓敏.多弹自主编队控制与协同航路规划方法研究.北京:北京航空航天大学自动化科学与电气工程学院,2010 Mu Xiaomin.Methods of autonomous formation control and cooperative route planning for multi-missiles.Beijing:School of Automation Science and Electrical Engineering,Beijing University of Aeronautics and Astronautics,2010(in Chinese) [10] Banks A,Vincent J,Anyakoha C.A review of particle swarm optimization-Part II:hybridization,computational,multicriteria and constrained optimization,and indicative application[J].Natural Computing,2008,7(1):109-124 [11] Dorigo M,Stutzle T.Ant colony optimization[M].Cambridge:The MIT Press,2004
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Article Metrics

    Article views(2410) PDF downloads(6) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return