Aircraft Emergency Trajectory Design: A Fast Marching Method on a Tetrahedral Mesh

An Accelerated Dual Fast Marching Tree Applied to Emergency Geometric Trajectory Generation

“…However, this smoothing significantly increased the computing time required for the generation of a trajectory but it was still reasonable. The average computing time was less than 10 s. Ligny et al [10] presented different computational performance tests on similar scenarios. Their algorithm generated a trajectory very quickly (about 1 s).…”

“…The computing time required for the generation of a trajectory is not mentioned or is above one minute. Ligny et al [10] propose a very efficient algorithm to solve this problem. Their method, based on the fast marching method, generates a trajectory in less than 1 s. However, the usability of the algorithm remains limited.…”

“…This algorithm is based on P-RRT* [13] combined with a line-ofsight path optimizer. Other works [10,14,15] have proposed generating trajectories using methods based on fast marching. This is a front-propagation method that functions in the manner of a forest fire.This method is very efficient but it does not seem to be very adaptable to diverse types of problem.…”

“…This is a front-propagation method that functions in the manner of a forest fire.This method is very efficient but it does not seem to be very adaptable to diverse types of problem. For example, it seems complicated to take into account the aeronautical constraints, as explained by Ligny et al [10] in their paper. Some papers [16][17][18] have proposed using a very efficient graph-based path planning algorithm.…”

Aircraft Cruise Alternative Trajectories Generation: A Mixed RRG-Clustering Approach

“…Many approaches have been developed to find a solution to the path planning problem. Among them, optimal control [4,16,24], graph [2,21], or front propagation [22,27,28] approaches can be mentioned. This state-of-the-art focuses on sampling-based path planning methods.…”