Abstract

Multirotor Unmanned Aerial Vehicles (UAVs) play an imperative role in many real-world applications in a variety of scenarios characterized by a high density of obstacles with different heights. Due to the complicated operation areas of UAVs and complex constraints associated with the assigned mission, there should be a suitable path to fly. Therefore, the most relevant challenge is how to plan a flyable path for a UAV without collisions with obstacles. This paper demonstrates how a flyable and continuous trajectory was constructed by using any-angle pathfinding algorithms, which are Basic Theta*, Lazy Theta*, and Phi* algorithms for a multirotor UAV in a cluttered environment. The three algorithms were modified by adopting a modified cost function during their implementation that considers the elevation of nodes. First, suitable paths are generated by using a modified version of the three algorithms. After that, four Bézier curves-based approaches are proposed to smooth the generated paths to be converted to flyable paths (trajectories). To determine the most suitable approach, particularly when searching for an optimal and collision-free trajectory design, an innovative evaluation process is proposed and applied in a variety of different size environments. The evaluation process results show high success rates of the four approaches; however, the approach with the highest success rate is adopted. Finally, based on the results of the evaluation process, a novel algorithm is proposed to increase the efficiency of the selected approach to the optimality in the construction process of the trajectory.

Highlights

  • Introduction published maps and institutional affilIn recent years, multirotor Unmanned Aerial Vehicles (UAVs) have been getting considerable attention from many, whether researchers or ordinary people due to many features; for instance, their unique abilities to fly in various environments, whether indoor areas or outdoor densely populated civilian areas

  • Phi* algorithm is another version of Basic Theta* algorithm, which is more convenient for working in unknown environments compared to the aforementioned algorithms, especially with its incremental version

  • Bézier curves were employed to principle design the of trajectory, which are this shown in Fig- constructs ofdescribed special polynomial functions, which can effectively describe mathematical urea 3set and in Equations basis curves or sketches drawn by designers

Read more

Summary

Path Planning

Path planning is a process of generating a feasible and suitable path in a cluttered environment for a UAV from a specific start point to a specific goal point. The path of the flight is created with Basic Theta*, Lazy Theta* and Phi* algorithms within a 2D grid environment. The definition of the grid and its data structure is primarily demonstrated . The three any-angle pathfinding algorithms and the modified cost function are described

Grid Representation
Any-Angle Pathfinding Algorithms
Cost Function
Trajectory Design n!
Proposed Approach
The sitions ofofeach
Results and Discussion
Implementation of the Modified Any-Angle Pathfinding Algorithms
Performance Comparison of the Three Any-Angle Pathfinding Algorithms
Implementation of the grid
Two midpoints have been at the
11. Theoftrajectories of the four
Evaluation process
Figures andhas
Conclusions
5.Conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call