A Hybrid Metaheuristic DE/CS Algorithm for UCAV Three-Dimension Path Planning
Three-dimension path planning for uninhabited combat air vehicle (UCAV) is a complicated high-dimension optimization problem, which primarily centralizes on optimizing the flight route considering the different kinds of constrains under complicated battle field environments. A new hybrid metaheurist...
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2012-01-01
|
| Series: | The Scientific World Journal |
| Online Access: | http://dx.doi.org/10.1100/2012/583973 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832558343052328960 |
|---|---|
| author | Gaige Wang Lihong Guo Hong Duan Heqi Wang Luo Liu Mingzhen Shao |
| author_facet | Gaige Wang Lihong Guo Hong Duan Heqi Wang Luo Liu Mingzhen Shao |
| author_sort | Gaige Wang |
| collection | DOAJ |
| description | Three-dimension path planning for uninhabited combat air vehicle (UCAV) is a complicated high-dimension optimization problem, which primarily centralizes on optimizing the flight route considering the different kinds of constrains under complicated battle field environments. A new hybrid metaheuristic differential evolution (DE) and cuckoo search (CS) algorithm is proposed to solve the UCAV three-dimension path planning problem. DE is applied to optimize the process of selecting cuckoos of the improved CS model during the process of cuckoo updating in nest. The cuckoos can act as an agent in searching the optimal UCAV path. And then, the UCAV can find the safe path by connecting the chosen nodes of the coordinates while avoiding the threat areas and costing minimum fuel. This new approach can accelerate the global convergence speed while preserving the strong robustness of the basic CS. The realization procedure for this hybrid metaheuristic approach DE/CS is also presented. In order to make the optimized UCAV path more feasible, the B-Spline curve is adopted for smoothing the path. To prove the performance of this proposed hybrid metaheuristic method, it is compared with basic CS algorithm. The experiment shows that the proposed approach is more effective and feasible in UCAV three-dimension path planning than the basic CS model. |
| format | Article |
| id | doaj-art-c3c40330750b436e9f0ccd01cb74e8ec |
| institution | Kabale University |
| issn | 1537-744X |
| language | English |
| publishDate | 2012-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | The Scientific World Journal |
| spelling | doaj-art-c3c40330750b436e9f0ccd01cb74e8ec2025-02-03T01:32:43ZengWileyThe Scientific World Journal1537-744X2012-01-01201210.1100/2012/583973583973A Hybrid Metaheuristic DE/CS Algorithm for UCAV Three-Dimension Path PlanningGaige Wang0Lihong Guo1Hong Duan2Heqi Wang3Luo Liu4Mingzhen Shao5Changchun Institute of Optics, Fine Mechanics and Physics, Chinese Academy of Sciences, Changchun 130033, ChinaChangchun Institute of Optics, Fine Mechanics and Physics, Chinese Academy of Sciences, Changchun 130033, ChinaSchool of Computer Science and Information Technology, Northeast Normal University, Changchun 130117, ChinaChangchun Institute of Optics, Fine Mechanics and Physics, Chinese Academy of Sciences, Changchun 130033, ChinaChangchun Institute of Optics, Fine Mechanics and Physics, Chinese Academy of Sciences, Changchun 130033, ChinaChangchun Institute of Optics, Fine Mechanics and Physics, Chinese Academy of Sciences, Changchun 130033, ChinaThree-dimension path planning for uninhabited combat air vehicle (UCAV) is a complicated high-dimension optimization problem, which primarily centralizes on optimizing the flight route considering the different kinds of constrains under complicated battle field environments. A new hybrid metaheuristic differential evolution (DE) and cuckoo search (CS) algorithm is proposed to solve the UCAV three-dimension path planning problem. DE is applied to optimize the process of selecting cuckoos of the improved CS model during the process of cuckoo updating in nest. The cuckoos can act as an agent in searching the optimal UCAV path. And then, the UCAV can find the safe path by connecting the chosen nodes of the coordinates while avoiding the threat areas and costing minimum fuel. This new approach can accelerate the global convergence speed while preserving the strong robustness of the basic CS. The realization procedure for this hybrid metaheuristic approach DE/CS is also presented. In order to make the optimized UCAV path more feasible, the B-Spline curve is adopted for smoothing the path. To prove the performance of this proposed hybrid metaheuristic method, it is compared with basic CS algorithm. The experiment shows that the proposed approach is more effective and feasible in UCAV three-dimension path planning than the basic CS model.http://dx.doi.org/10.1100/2012/583973 |
| spellingShingle | Gaige Wang Lihong Guo Hong Duan Heqi Wang Luo Liu Mingzhen Shao A Hybrid Metaheuristic DE/CS Algorithm for UCAV Three-Dimension Path Planning The Scientific World Journal |
| title | A Hybrid Metaheuristic DE/CS Algorithm for UCAV Three-Dimension Path Planning |
| title_full | A Hybrid Metaheuristic DE/CS Algorithm for UCAV Three-Dimension Path Planning |
| title_fullStr | A Hybrid Metaheuristic DE/CS Algorithm for UCAV Three-Dimension Path Planning |
| title_full_unstemmed | A Hybrid Metaheuristic DE/CS Algorithm for UCAV Three-Dimension Path Planning |
| title_short | A Hybrid Metaheuristic DE/CS Algorithm for UCAV Three-Dimension Path Planning |
| title_sort | hybrid metaheuristic de cs algorithm for ucav three dimension path planning |
| url | http://dx.doi.org/10.1100/2012/583973 |
| work_keys_str_mv | AT gaigewang ahybridmetaheuristicdecsalgorithmforucavthreedimensionpathplanning AT lihongguo ahybridmetaheuristicdecsalgorithmforucavthreedimensionpathplanning AT hongduan ahybridmetaheuristicdecsalgorithmforucavthreedimensionpathplanning AT heqiwang ahybridmetaheuristicdecsalgorithmforucavthreedimensionpathplanning AT luoliu ahybridmetaheuristicdecsalgorithmforucavthreedimensionpathplanning AT mingzhenshao ahybridmetaheuristicdecsalgorithmforucavthreedimensionpathplanning AT gaigewang hybridmetaheuristicdecsalgorithmforucavthreedimensionpathplanning AT lihongguo hybridmetaheuristicdecsalgorithmforucavthreedimensionpathplanning AT hongduan hybridmetaheuristicdecsalgorithmforucavthreedimensionpathplanning AT heqiwang hybridmetaheuristicdecsalgorithmforucavthreedimensionpathplanning AT luoliu hybridmetaheuristicdecsalgorithmforucavthreedimensionpathplanning AT mingzhenshao hybridmetaheuristicdecsalgorithmforucavthreedimensionpathplanning |