Optimization of an Enroute Algorithm

Abstract

Highly automated flight is a growing trend in aerospace. To allow helicopters to move from A to B, it is necessary to plan paths. An algorithm to plan enroute flight paths has been developed during ALLFlight project at DLR Braunschweig. However, the initial runtime performance was insufcient for online path planning during flight experiments. In this work, we present several runtime optimizations that we used to reduce the planning time. The runtime Performance is evaluated using a set of benchmark scenarios. It can be shown that the optimizations are sufcient to allow online path planning for the ACT/FHS research helicopter within the frame of the dened scenarios. Furthermore, it can be shown that this algorithm can now be used in real life scenarios like fligh in Alpha Ventus Windpark.