Two-Point Flight Path Planning Using A Fast Graph-Search Algorithm

Abstract

This paper presents a method, using a fast graph-search algorithm, of finding a feasible flight path for an air vehicle that flies between two locations. This flight path must satisfy the many constraints required to make the flight safe and efficient. We start by constructing a virtual terrain as a search space above the real terrain, to take into account real flight conditions and the limitations of the vehicle's performance. Consideration of safe altitude, the horizontal safety distance of the flight path and the phase of take-off and landing are included. The idea of a virtual terrain could also eliminate a significant amount of search space, from 3-Dimensions to 2-Dimensions, which takes much less computation time, but which may have a shortcoming in rugged terrain where most path points are higher than the cruise altitude. Hence we propose a further process, which takes less than a second with no extra computational load, to overcome this problem. A dimensionless fuel consumption ratio between climbing and level-turn is proposed to deal with the case of level flying between valleys. If climbing requires greater fuel consumption than taking a level turn, the algorithm chooses the level altitude flight path, hence improving the vertical smoothness of the flight. Using all these methods, including multi-resolution terrain and a fast searching method using a heuristic, we have successfully reduced the computation time of the algorithm to an acceptable level, and the simulation results show that our algorithm is feasible.Nomenclature C(i, j, m) = cost tensor DTEM = digital terrain elevation map D (i, j, m) = Distance function dh = altitude difference between two neighboring points EG = number of extended frontiers for hierarchical scheme F (i, j) = Forbidden matrix FCC = fuel consumption of climbing FCLT = fuel consumption of level turn g d = grid space(size) g dx , g dy = grid space in x and y coordinate H = cruise altitude Hc = safe altitude for flying over obstacles h (i, j ) = heuristic function = integer grid indices (i d , j d ) = integer grid index of destination point (i s , j s ) = integer grid index of start point KD = heuristic factor Kdh = dimensionless factor of fuel consumption ratio L (i, j, m) = Mapping function (L 1 (i, j, m), L 2 (i, j, m)) = one of the eight adjacent points of point(i, j )in direction m M(i, j, m) = 1 = Admissible matrix m = integer move indices mt = take-off direction ml = landing direction n = number of running step of algorithm nl = stages number of landing slope nt = stages number of take-off slope P (i, j) = point in grid space RC = maximum climbing rate of the air vehicle R min = minimum radius of level turn RC pg = climbing altitude per grid distance r = integer move indices of the points in second frontier r * (i, j, m) = optimal move tensor res = map down sampling factor S = number of states of search space S h = horizontal safety distance for passing through obstacles S m (i, j ) = admissible set of first frontier S r (i, j, m) = admissible set funct...

Unmanned Aerial Vehicles Evolutional Flight Route Planner Using the Potential Field Approach

“…The artificial potential field method was proposed in [31][32][33] for navigating mobile robots. The artificial potential field method is considered a bridge connecting obstacle avoidance and route searching problem.…”

DIMPL: a distributed in-memory drone flight path builder system

“…UAV path planning using Particle Swarm Optimization and digital pheromones incorporating vehicle mechanics to generate multiple 3-d paths for operators have been proposed [24], as have optimization algorithms for multiobjective drone route planning [32]. Fast graph search algorithms that satisfy constraints on flights have been used to determine the optimum path of a drone traveling between two given locations [13] and UAV flight path planning in time-space varying wind fields using a kinematic tree path planner have been developed [12]. None of these techniques have sought to pre-build the flight paths of drones and then allow them to navigate along the path.…”

Integrated Flight Path Planning System and Flight Control System for Unmanned Helicopters

“…One important part of the navigation and guidance systems proposed in this work is the FPPS. In this paper, the FPPS is designed by using the A-Star (A*) algorithm [ 3 ] which is a best-first graph search algorithm to plan the flight path, and the system is able to reduce the computation load and improve the efficiency [ 4 ]. Moreover, the FPPS developed in this work is capable of generating a flight path that excludes any predefined forbidden zone.…”

“…In 2006, the Remotely Piloted Vehicle and Microsatellite Research Laboratory (RMRL) at the Institute of Aeronautics and Astronautics (IAA) of National Cheng Kung University (NCKU) built a path planning system using a fast graph-search algorithm to find a feasible flight path for an UAV to traverse multiple targets [ 4 ]. Based on the real flight conditions and the limitations of the UAV’s performance, the system constructed a virtual terrain as a search space above the real terrain.…”

“…Based on the real flight conditions and the limitations of the UAV’s performance, the system constructed a virtual terrain as a search space above the real terrain. The idea of a virtual terrain in [ 4 ] can eliminate a significant amount of search space from the 3-D plot to the 2-D to reduce computation time. In recent years, the RMRL has also been concentrating on the development of payload systems.…”