A Constrained Driven Genetic Algorithm for Path Planning of Anti-ship Missile
Tan Dong-feng · Journal of Ballistics · 2012
To improve the efficiency of path planning solved by Genetic Algorithm(GA),a CD-GA(Constraints-Driven GA) for path planning was proposed.Compared with traditional GA,the association constraints among path nodes were applied to immediately limit accurate variation-rang of genetic value in the process of optimization by the algorithm.To make the chromosome be close to the characteristics of path,fixed-length real-number matrix encoding method was applied.The initial populations were generated by an initialization strategy with sequential recursion to ensure the individuals to be superior.In the iteration process of algorithm,the crossover and mutation were carried out using successive-multi-points sequential crossover strategy and disturbance-sequential-restoration mutation strategy respectively,and the search space of the algorithm decreased gradually,thereby the convergence of the algorithm was accelerated.The result of simulation test shows that the proposed algorithm can improve the overall searching ability of GA obviously,and the algorithm has quick convergence and good stability.