A discrete-continuous algorithm for free flight planning

6Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.

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.

Cite

CITATION STYLE

APA

Borndörfer, R., Danecker, F., & Weiser, M. (2021). A discrete-continuous algorithm for free flight planning. Algorithms, 14(1), 1–17. https://doi.org/10.3390/a14010004

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free