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...

Full description

Bibliographic Details
Main Authors: Maoquan Li, Yunfei Zhang, Shihao Li
Format: Article
Language:English
Published: EDP Sciences 2018-01-01
Series:MATEC Web of Conferences
Online Access:https://doi.org/10.1051/matecconf/201815104001
id doaj-47ebec7e83e245b5b46a84e086365e41
record_format Article
spelling doaj-47ebec7e83e245b5b46a84e086365e412021-02-02T04:57:30ZengEDP SciencesMATEC Web of Conferences2261-236X2018-01-011510400110.1051/matecconf/201815104001matecconf_acmae2018_04001The Gradational Route Planning for Aircraft Stealth Penetration Based on Genetic Algorithm and Sparse A-Star AlgorithmMaoquan LiYunfei ZhangShihao LiIt 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.https://doi.org/10.1051/matecconf/201815104001
collection DOAJ
language English
format Article
sources DOAJ
author Maoquan Li
Yunfei Zhang
Shihao Li
spellingShingle Maoquan Li
Yunfei Zhang
Shihao Li
The Gradational Route Planning for Aircraft Stealth Penetration Based on Genetic Algorithm and Sparse A-Star Algorithm
MATEC Web of Conferences
author_facet Maoquan Li
Yunfei Zhang
Shihao Li
author_sort Maoquan Li
title The Gradational Route Planning for Aircraft Stealth Penetration Based on Genetic Algorithm and Sparse A-Star Algorithm
title_short The Gradational Route Planning for Aircraft Stealth Penetration Based on Genetic Algorithm and Sparse A-Star Algorithm
title_full The Gradational Route Planning for Aircraft Stealth Penetration Based on Genetic Algorithm and Sparse A-Star Algorithm
title_fullStr The Gradational Route Planning for Aircraft Stealth Penetration Based on Genetic Algorithm and Sparse A-Star Algorithm
title_full_unstemmed The Gradational Route Planning for Aircraft Stealth Penetration Based on Genetic Algorithm and Sparse A-Star Algorithm
title_sort gradational route planning for aircraft stealth penetration based on genetic algorithm and sparse a-star algorithm
publisher EDP Sciences
series MATEC Web of Conferences
issn 2261-236X
publishDate 2018-01-01
description 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.
url https://doi.org/10.1051/matecconf/201815104001
work_keys_str_mv AT maoquanli thegradationalrouteplanningforaircraftstealthpenetrationbasedongeneticalgorithmandsparseastaralgorithm
AT yunfeizhang thegradationalrouteplanningforaircraftstealthpenetrationbasedongeneticalgorithmandsparseastaralgorithm
AT shihaoli thegradationalrouteplanningforaircraftstealthpenetrationbasedongeneticalgorithmandsparseastaralgorithm
AT maoquanli gradationalrouteplanningforaircraftstealthpenetrationbasedongeneticalgorithmandsparseastaralgorithm
AT yunfeizhang gradationalrouteplanningforaircraftstealthpenetrationbasedongeneticalgorithmandsparseastaralgorithm
AT shihaoli gradationalrouteplanningforaircraftstealthpenetrationbasedongeneticalgorithmandsparseastaralgorithm
_version_ 1724304635637792768