Path planning is important for the autonomy of Unmanned Aerial Vehicle (UAV), especially for scheduling UAV delivery. However, the operating environment of UAVs is usually uncertain and dynamic. Without proper planning, collisions may happen where multiple UAVs are congested. Besides, there may also be temporary no-fly zone setup by authorities that makes airspace unusable. Thus, proper pre-departure planning that avoids such places is needed. In this paper, we formulate this problem into a Constraint Satisfaction Problem to find a collision-free shortest path on a dynamic graph. We propose a collision-free path planning algorithm that is based on A* algorithm. The main novelty is that we invent a heuristic function that also considers waiting time. We later show that, with added waiting penalty, the proposed algorithm is optimal because the heuristic is admissible. Implementation of this algorithm simulates UAV delivery using Singapore's airspace structure. Our simulation exhibits desirable runtime performance. Using the proposed algorithm, the percentage of collision-free routes decreases as number of requests per unit area increases, and this percentage drops significantly at boundary value. Our empirical analysis could aid the decision-making of no-fly zone policy and infrastructure of UAV delivery.
Off-line algorithms plan the path prior to departure. The aircraft are usually modelled as point mass moving in two dimensions with constant speed and upper-bounded turning rate. @cite_7 uses Genetic Algorithm (GA) to find optimal flyable path through numerous iterations, with each iteration improving previous path by rerouting at waypoint. The problem with Genetic Algorithm is that runtime grows exponentially as number of iterations and flights grows. @cite_5 @cite_2 also uses GA, but with a parallel approach to speedup the calculation. @cite_10 formulates vehicle dynamic model, collision avoidance constraint, and multiple waypoint constraint as mixed-integer linear program (MILP). One of its novelty is that it uses trigonometric functions to better approximate the radius constraint. However, it does not consider battery constraint, which is a limiting factor to UAV's delivery capability. In this paper, we will address both collision avoidance constraint and battery constraint.
@cite_5 @cite_10 @cite_7 @cite_2
2101997841 2102488278 1496280582 2142464062
Describes a method for finding optimal trajectories for multiple aircraft avoiding collisions. Developments in spacecraft path-planning have shown that trajectory optimization including collision avoidance can be written as a linear program subject to mixed integer constraints, known as a mixed-integer linear program (MILP). This can be solved using commercial software written for the operations research community. In the paper, an approximate model of aircraft dynamics using only linear constraints is developed, enabling the MILP approach to be applied to aircraft collision avoidance. The formulation can also be extended to include multiple waypoint path-planning, in which each vehicle is required to visit a set of points in an order chosen within the optimization. In recent years, Unmanned Aerial Vehicles (UAVs) have been used in many military and civil application areas, due to their increased endurance, performance, portability, and their larger payload-carrying, computing and communication capabilities. Because of UAVs' complex operation areas and complicated constraints related to the assigned task, they have to fly on a path, which is calculated online and or offline to satisfy these constraints and to check some control points in the operation theatre. If the number of control points and constraints increases, finding a feasible solution takes up too much time in this large operation area. In this case, the use of multi-UAVs decreases operation completion time; however, this usage increases the complexity of finding a feasible path problem. This problem is typically NP-hard and genetic algorithms have been successfully utilized for solving it in the last few decades. This paper presents how a flyable trajectory can be constructed for multi-UAV systems by using a Genetic Algorithm (GA) in a known environment and at a constant altitude. A GA is implemented parallel in a multi-core environment to increase the performance of the system. First, a feasible path is calculated by using a parallel GA, and then the path is smoothed by using Bezier curves to convert it flyable. Preliminary results show that the proposed method provides an effective and feasible path for each UAV in an Unmanned Aerial System with multi-UAVs. The proposed system is realized in Java with a GUI for showing results. This paper also outlines future work that can be conducted on the multi-UAV path planning. In the last years, the Flight Mechanics Research Group of Politecnico di Torino started a wide research activity, focused on exploration and implementation of path planning algorithms for commercial autopilots, typically adopted on unmanned vehicles. Different path planning approaches were implemented in a Matlab Simulink based tool, generating waypoints sequences with four methods: geometric predefined trajectories, manual waypoints definition, automatic waypoints distribution (i.e. optimizing camera payload capabilities) and, finally, a comprehensive A*-based approach. The tool was also integrated with functions managing the maps used for planning. In this paper, two approaches to path planning in presence of orographic obstacles are detailed. The first algorithm is subdivided in three phases: the generation of a risk map associated with the ground orography, the transformation of the map in a digraph analyzed with the A* algorithm (to obtain the path with minimum risk minimum distance) and finally the smoothing phase, to obtain a flyable waypoint sequence, realized with the Dubins curves. The structure of this method was defined and implemented, but its optimization is still in progress. The second algorithm is based on the same risk map, but optimizing polynomial curves with a genetic algorithm. This method produces a flyable waypoints sequence, minimizing a cost function reflecting path length and collision risk. An extension of this path solver, including aircraft performance constraints, was also considered. This method was tested on sample domains and its computational cost has still to be evaluated before the implementation in the tool. Unmanned Systems has been taking place of manned systems in several fields like aviation. Unmanned Aerial Vehicle (UAV), one of the most popular and effective unmanned systems, is gradually becoming the vital element of aviation because of its high success rate in both military and civilian missions. Basic problem of UAV is finding the best path in tough environment. Coverage zones of radars and complex environment are the main obstacles in this problem. A UAV intends to travel all control points in an optimal way to be more productive while avoiding radars. In this paper, we used Genetic Algorithm (GA), which is Evolutionary algorithm, to find the optimal flyable path for the UAVs in a 3D environment. Each generation is anticipated to be better than its previous generation in GA. For the purpose of reaching an optimal path, solving the Travelling Salesman Problem (TSP) is one of the major phases in the proposed method. In order to show the visual of solution in better quality, we preferred MATLAB as the implementation environment. Additionally, there is a shared library and mathematical calculations are easier in MATLAB. The complexity of our problem can be increased by adding extra constraints caused by the dynamic environment as the future works. Experimental results show that GA can be opted for optimal path planning for the UAVs.