We use a few cookies

Essential cookies keep the library working. With your permission, we'd also like to use analytics to see what's useful and improve the experience. Read our Privacy Policy or Cookie Policy.

Skip to main content
Home/e-Resources/Computer Science & Information Technology/A Discrete-Continuous Algorithm for Globally Optimal Free Flight Trajectory Optimization
PeriodicalsComputer Science & Information Technology

A Discrete-Continuous Algorithm for Globally Optimal Free Flight Trajectory Optimization

Checking your access to this record.

Abstract & Overview

We present an efficient algorithm that finds a globally optimal solution to the 2D Free Flight Trajectory Optimization Problem (aka Zermelo Navigation Problem) up to arbitrary precision in finite time. The algorithm combines a discrete and a continuous optimization phase. In the discrete phase, a set of candidate paths that densely covers the trajectory space is created on a directed auxiliary graph. Then Yen’s algorithm provides a promising set of discrete candidate paths which subsequently undergo a locally convergent refinement stage. Provided that the auxiliary graph is sufficiently dense, the method finds a path that lies within the convex domain around the global minimizer. From this starting point, the second stage will converge rapidly to the optimum. The density of the auxiliary graph depends solely on the wind field, and not on the accuracy of the solution, such that the method inherits the superior asymptotic convergence properties of the optimal control stage.

Cite this record

Borndörfer, Ralf, Danecker, Fabian, Weiser, Martin (2022). A Discrete-Continuous Algorithm for Globally Optimal Free Flight Trajectory Optimization. OASIcs : OpenAccess Series in Informatics. https://doi.org/10.4230/oasics.atmos.2022.2

Copy in another style

Ralf, B., Fabian, D., & Martin, W. (2022). A Discrete-Continuous Algorithm for Globally Optimal Free Flight Trajectory Optimization. OASIcs : OpenAccess Series in Informatics. https://doi.org/10.4230/oasics.atmos.2022.2
Author names are used as deposited, so check their order before you submit.

Metadata is harvested from open-access indexes and can be incomplete. Check a citation against the published version before relying on it — see our open access & attribution policy.