Abstract

We propose a hybrid discrete-continuous algorithm for flight planning in free flight airspaces. In a first step, our discrete-continuous optimization for enhanced resolution (DisCOptER) method computes a globally optimal approximate flight path on a discretization of the problem using the A* method. This route initializes a Newton method that converges rapidly to the smooth optimum in a second step. The correctness, accuracy, and complexity of the method are governed by the choice of the crossover point that determines the coarseness of the discretization. We analyze the optimal choice of the crossover point and demonstrate the asymtotic superority of DisCOptER over a purely discrete approach.

Highlights

  • We propose in this paper the novel hybrid algorithm discrete-continuous optimization for enhanced resolution (DisCOptER) that combines the strengths of discrete and continuous approaches to flight planning, and provide a numerical study of its efficiency and accuracy

  • We evaluated the DisCOptER algorithm for varying graph densities, using the theoretically optimal graph structure of h = l 2, cf. (14)

  • In this paper we presented the novel DisCOptER algorithm to calculate flight paths in free flight airspaces utilizing a combination of discrete and continuous optimization

Read more

Summary

Introduction

Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. Flight planning is concerned with the computation of time and fuel efficient flight paths with respect to the weather, see [1] for a comprehensive survey. Wind conditions make a big difference: flying with a headwind of 60 kts increases flight time and fuel consumption of an Airbus A321 by as much as 20% over a tailwind of 60 kts [2]

Objectives
Methods
Results
Conclusion
Full Text
Paper version not known

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.