The Gradational Route Planning for Aircraft Stealth Penetration Based on Genetic Algorithm and Sparse A-Star Algorithm
It is established for a gradational route planning algorithm which includes two layers. The first layer makes use of genetic algorithm to obtain the global optimal path by its global optimal characteristics. The second layer makes use of A* algorithm to obtain the local optimal path by its dynamic c...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
EDP Sciences
2018-01-01
|
| Series: | MATEC Web of Conferences |
| Online Access: | https://doi.org/10.1051/matecconf/201815104001 |
| Summary: | It is established for a gradational route planning algorithm which includes two layers. The first layer makes use of genetic algorithm to obtain the global optimal path by its global optimal characteristics. The second layer makes use of A* algorithm to obtain the local optimal path by its dynamic characteristic. When flying along the global optimal path, locating the new threat and confirming its performance, the aircraft can plan the local optimal path timely by A* algorithm. It is constructed for the cost function with two goals of the range and the average detection probability, which is used as the goal function for optimal path planning. Two paths that obtained from two optimal methods are merged to construct the optimal route comprehensively considering the threats and range. The simulation result shows that the cost of new optimal route is lower than the original optimal path obtained only by the genetic algorithm.It revealed that our algorithm could obtain an optimal path when a new radar threas occured. |
|---|---|
| ISSN: | 2261-236X |