2017
DOI: 10.1155/2017/8936164
|View full text |Cite
|
Sign up to set email alerts
|

An Improved Heuristic Algorithm for UCAV Path Planning

Abstract: The study of unmanned combat aerial vehicle (UCAV) path planning is increasingly important in military and civil field. This paper presents a new mathematical model and an improved heuristic algorithm based on Sparse * Search (SAS) for UCAV path planning problem. In this paper, flight constrained conditions will be considered to meet the flight restrictions and task demands. With three simulations, the impacts of the model on the algorithms will be investigated, and the effectiveness and the advantages of the … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 10 publications
0
3
0
Order By: Relevance
“…The method presented by Zhang et al. [ 27 ] is also worth noting. This paper presents an improved heuristic algorithm based on Sparse Search for UAV path planning problem.…”
Section: Uav Flight Planning Procedures Using Sensors To Recognize mentioning
confidence: 99%
“…The method presented by Zhang et al. [ 27 ] is also worth noting. This paper presents an improved heuristic algorithm based on Sparse Search for UAV path planning problem.…”
Section: Uav Flight Planning Procedures Using Sensors To Recognize mentioning
confidence: 99%
“…Zhang Kun et al [80] proposed an improved heuristic algorithm based on SAS considering the UAV flight constraints to find a feasible path efficiently. Sikha Hota and Debasish Ghose [81] proposed a geometric approach for optimal path planning in 3D space considering UAV minimum turn radius.…”
Section: Background and Related Workmentioning
confidence: 99%
“…(1) Based on searching: Dijkstra algorithm [4] and A * algorithm [5] (2) Based on probability: rapidly exploring Random Trees (RRT) [6] and rapidly exploring Random Trees * (RRT * ) [7] (3) Based on metaheuristic algorithm: particle swarm optimization (PSO) [8] In this study, a metaheuristic algorithm is employed to optimize the robot path planning. Compared with other algorithms, a metaheuristic algorithm can achieve a stable convergence and avoid trapping into a local optimal solution, especially when facing a complex environment.…”
Section: Introductionmentioning
confidence: 99%