An A* Algorithm for Flight Planning Based on Idealized Vertical Profiles
- The Flight Planning Problem is to find a minimum fuel trajectory between two airports in a 3D airway network under consideration of the wind. We show that this problem is NP-hard, even in its most basic version. We then present a novel A∗ heuristic, whose potential function is derived from an idealized vertical profile over the remaining flight distance. This potential is, under rather general assumptions, both admissible and consistent and it can be computed efficiently. The method outperforms the state-of-the-art heuristic on real-life instances.
| Author: | Marco Blanco, Ralf BorndörferORCiD, Pedro Maristany de las Casas |
|---|---|
| Document Type: | In Proceedings |
| Parent Title (English): | 22nd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2022) |
| Volume: | 106 |
| First Page: | 1:1 |
| Last Page: | 1:15 |
| Year of first publication: | 2022 |
| DOI: | https://doi.org/10.4230/OASIcs.ATMOS.2022.1 |
