| With the improvement of aviation science and technology and the increasing requirement of air combat, multi-targets attack and coordination for multiple air vehicles become the trend of development. Multi-route planning for air vehicles is one of the key technologies.This thesis concerns the algorithm of multi-route planning for air vehicles. Firstly, a brief survey is given on the multi-route planning, and the background and significance of route planning are also introduced. Then, concrete planning approaches are developed using modified genetic algorithm with some newly proposed operators. Finally, some simulation examples are developed to verify the effectiveness of the proposed planning approach. The main work in this thesis is summarized as below:1 . The threaten factors in planning environment and the technologies of digital map are analyzed. A new representation method of planning environment is proposed by using vector digital map. Because different environment attributes are presented in different data formats, this method can update the environment attributes on-line when environment changes.2. A new method of route evaluation is proposed based on classifying-comparing. By classifying the route firstly, then sorting route by cost in the same class, the route evaluation can be solved efficiently in the case of various mission constraints and part conflicts.3 . By combining the concepts of genetic algorithm with route planning, a new multi-route planning algorithm for air vehicle is presented. Using a real-value representation of chromosome and some problem-specific operators, all routes evolve in their own sub-population at the same time under the rout evaluating system. The simulation results demonstrate the algorithm can not only dispose various mission constraints efficiently and generates multiple routes on line for the vehicles, but also meet the need of real-time online planning.Finally, the summarization of this thesis and the view on future research are proposed.
|
PDF Full Text Request