2019
DOI: 10.11591/ijeecs.v15.i2.pp743-749
|View full text |Cite
|
Sign up to set email alerts
|

A review on graph search algorithms for optimal energy efficient path planning for an unmanned air vehicle

Abstract: <span>Unmanned Air Vehicle (UAV) has attracted attention in recent years in conducting missions for longer time with higher levels of autonomy. For the enhanced autonomous characteristic of UAV, path planning is one of the crucial issues. Current researches on the graph search algorithms under combinatorial method are mainly reviewed in this paper by keeping focus on the comprehensive surveys of its properties for path planning. The outcome is a pen picture of their assumptions and drawbacks.</span> Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
10
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
9
1

Relationship

0
10

Authors

Journals

citations
Cited by 31 publications
(12 citation statements)
references
References 18 publications
0
10
0
Order By: Relevance
“…Recently, the works in [ 56 , 57 ] utilized deep reinforcement learning techniques, such as Q-learning, as a promising solution to solve the problem of real-time drone path planning in unknown dynamic environments. Alternatively, heuristics intelligent optimization algorithms have also been widely used in recent years to solve the local path planning optimization problems, such as graph-based algorithms [ 58 ], heuristic search algorithms [ 59 ], field-based algorithms [ 60 ], and intelligent optimization algorithms [ 61 ].…”
Section: Related Workmentioning
confidence: 99%
“…Recently, the works in [ 56 , 57 ] utilized deep reinforcement learning techniques, such as Q-learning, as a promising solution to solve the problem of real-time drone path planning in unknown dynamic environments. Alternatively, heuristics intelligent optimization algorithms have also been widely used in recent years to solve the local path planning optimization problems, such as graph-based algorithms [ 58 ], heuristic search algorithms [ 59 ], field-based algorithms [ 60 ], and intelligent optimization algorithms [ 61 ].…”
Section: Related Workmentioning
confidence: 99%
“…Relevant scholars generate path points, construct a connected graph in free space, and convert the solution space of the path planning problem into a topological space, so that the complexity of the problem is independent of the complexity of the environment and the dimension of the planning space [18]. The disadvantage of this method is that when the obstacles in the planning space are dense or there are narrow passages, the efficiency of the method will become low [19,20]. In addition, because this method randomly samples the signpost nodes when constructing the connected graph, it is easy to cause the final search path to deviate from the optimal.…”
Section: Introductionmentioning
confidence: 99%
“…Since many robots work in crowded and cluttered environments, the obstacle avoidance problem, in general, is not straightforward to solve [ 3 ]. Most of the traditional path planning algorithms can be classified into several categories: graph search methods [ 4 ], sampling-based method [ 5 ], and intelligent bionic methods [ 6 ]. The most widely used graph search algorithm is the A* search method [ 7 ], which was developed by Hart in 1968.…”
Section: Introductionmentioning
confidence: 99%