%A ZHAO Yanli;ZHAO Xiaohu;LIU Kangming
%T Path Planning for UCAV Based on Voronoi Diagram and Quantum-Behaved Particle Swarm Algorism
%0 Journal Article
%D 2013
%J Science & Technology Review
%R 10.3981/j.issn.1000-7857.2013.22.012
%P 69-72
%V 31
%N 22
%U {http://www.kjdb.org/CN/abstract/article_10728.shtml}
%8 2013-08-08
%X Path routing for Unmanned Combat Aerial Vehicle (UCAV) can be defined as the task of Unmanned Combat Aerial Vehicle automatically executing, which is a complex optimization problem. It is very hard to get the optimal solution in polynomial time. Therefore, in this paper a path planning method was proposed based on Voronoi diagram and Quantum-behaved Particle Swarm Optimization (QPSO) algorism. Firstly, the cost model for path planning of UCAV was defined by totally consideration for the radar threat and fuel consumption, and the Voronoi diagram was generated according to the given threat source. And then the initial path planning set was constructed by initial sites, the vertex of Voronoi diagram and the final sites. Finally, in order to conquer the problem of PSO algorism that has the defects of falling to optimal location, the Cauchy mutation random number was introduced to improve the global search ability of QPSO algorism, and using the improved QPSO algorism to plan path the specific algorism was defined. The result of simulation experiment shows the method proposed in this paper can obtain the optimal solution for UCAV, and it has the optimal cost 280 in comparison with PSO 600 and QPSO 350, respectively. Meanwhile, at the mean time, when the iteration time is 250, the improved QPSO in our paper is in convergence, so it can provide not only the optimal solution but also the rapid convergence speed. Thus it has big superiority over the other methods.