Abstract: The referenced flight path should be firstly determined in hierarchical flig ht path planning . To resolve theconflict betw een global opt imization and information processing in the algorit hm of referenced pat h planning, thispaper develops an adaptiv e g enetic algorit hm to the referenced path planning. In t he algor ithm the chromosome isconstructed by a sequence of flight directions, on the basis of which the crossover o perato r and mutation operator aredesigned. I n the process of ev olution, t he adaptive crossover probability and mutation probability are developed. Thenumerical applicat ion demonstrates that the proposed method reduces the memor y and processing of informatio n andimproves the global opt imization ability of the genetic algorit hm. The proposed method can provide penetration vehicles with a refer enced flight path satisfying the tactics requirement.

Key words: flight paths, genetic algorithm, optimization, adaption, low altitude penetration