Path planning of UCAV based on a modified GeesePSO algorithm

  • Authors:

  • Zheng-Fang Fu

  • Affiliations:

  • Department of Electronics and Information Engineering, Ankang University, Ankang, Shaanxi, China

  • Venue:
  • ICIC'12 Proceedings of the 8th international conference on Intelligent Computing Theories and Applications
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

The GeesePSO algorithm is modified and applied to path planning of UCAV in this paper. According to the feature of UCAV problem, a coding strategy which makes the X-coordinates fixed and only codes the Y-coordinates in the rectangular coordinate system was proposed. It is not only effectively reduces the length of the code, but also gives full play to the advantages of PSO algorithm in solving problems with continuous solution space. The simulation results showed that the modified GeesePSO algorithm had faster convergence speed and better convergence accuracy and the optimization path solved by it could ensure UCAVs reached the destination with the minimum probability of being found and the minimum energy consumption.