Flight planning in free route airspaces

DOI10.4230/OASICS.ATMOS.2017.14MaRDI QIDQ6571022zbMATH OpenFDO

Authors Casper Kehlet Jensen, Marco Chiarandini, Kim S. Larsen

Publication date 11 July 2024

Full work available at URL https://doi.org/10.4230/OASICS.ATMOS.2017.14

zbMATH Keywords

flight planningfree route airspacegeometric shortest pathvector weighted pathsvector weighted planar subdivisions

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Traffic problems in operations research (90B20) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Heuristic variants of \(\mathrm{A}^*\) search for 3D flight planning
• Solving time dependent shortest path problems on airway networks using super-optimal wind
• An \(\mathrm{A}^*\) algorithm for flight planning based on idealized vertical profiles
• Fly cheaply: On the minimum fuel consumption problem
• Routing multi-class traffic flows in the plane

Cited in

(2)

• An \(\mathrm{A}^*\) algorithm for flight planning based on idealized vertical profiles
• An efficient algorithm for vertical free-flight optimization in air transportation

This page was built for publication: Flight planning in free route airspaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6571022)