2019
DOI: 10.31142/ijtsrd23696
|View full text |Cite
|
Sign up to set email alerts
|

Path Planning Algorithms for Unmanned Aerial Vehicles

Abstract: In this paper, the shortest path for Unmanned Aerıal Vehicles (UAVs) is calculated with two-dimensional (2D) path planning algorithms in the environment including obstacles and thus the robots could perform their tasks as soon as possible in the environment. The aim of this paper is to avoid obstacles and to find the shortest way to the target point. Th e simulation environment was created to evaluate the arrival time on the path planning algorithms (A* and Dijkstra algorithms) for the UAVs. As a result, real-… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
14
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 18 publications
(14 citation statements)
references
References 9 publications
0
14
0
Order By: Relevance
“…(2016)), D star (D, Raheem et al. (2018)) and Dijkstra (Dhulkefl et al., 2019). These techniques uses a heuristic function that runs over all nodes (i.e.…”
Section: Path-planning Algorithmsmentioning
confidence: 99%
See 1 more Smart Citation
“…(2016)), D star (D, Raheem et al. (2018)) and Dijkstra (Dhulkefl et al., 2019). These techniques uses a heuristic function that runs over all nodes (i.e.…”
Section: Path-planning Algorithmsmentioning
confidence: 99%
“…Such methods support the representation of an environment in memory (see Figure 3), which results in path planning and robot localisation (Yang et al, 2014;Liu et al, 2016). There are several grid-based techniques used for path planning, including A star (A ★ , Guruji et al ( 2016)), D star (D ★ , Raheem et al ( 2018)) and Dijkstra (Dhulkefl et al, 2019). These techniques uses a heuristic function 𝑓 (𝑛) that runs over all nodes 𝑛 (i.e.…”
Section: Grid-based Techniquesmentioning
confidence: 99%
“…With those challenges, there is a need to optimize the drone flight path planning based on the locations of the sensors to minimize flight time and overcome battery limitations [101]. To optimize path planning capability, algorithms such as the traveling salesman problem, A Star (A*) algorithm [226], Dijkstra algorithm [226], and modified and improved Dijkstra algorithm [227,228] could be utilized. Optimizing the drone's flight capability would reduce cost, faster execution of missions, and increase navigation time, so there is a need to improve existing path planning algorithms to optimize the drone's navigation time.…”
Section: Challenges and Future Trendsmentioning
confidence: 99%
“…The authors compared the developed algorithm with another GWO algorithm, showing its statistical superiority. In [24] the chosen algorithms have been the A* and Dijkstra algorithms. Real time tests have been performed on a UAV and the two path length algorithms show the same path length.…”
Section: Multi-fusion Based Algorithmsmentioning
confidence: 99%