2018IOP Conference Series Materials Science and EngineeringOpen access

Flight trajectory optimization without decomposition into separate stages

S. A. Kumakshev, A. M. Shmatkov

Open full text 4 citations

Abstract

Optimization problem is solved for the trajectory of a typical medium range aircraft flying between two airdromes. The optimization is considered with respect to the fuel consumption and is performed for the entire trajectory, without decomposition into separate stages. The optimal trajectory is calculated on the basis of the complete model of the trajectory motion of an aircraft in a vertical plane. To account for all constraints imposed by both the engineering features of the aircraft, as well as other requirements, including passenger safety and comfort, Bellman's dynamic programming method is used.

Open-access reader

About this research paper

What this paper is about

Optimization problem is solved for the trajectory of a typical medium range aircraft flying between two airdromes. The optimization is considered with respect to the fuel consumption and is performed for the entire trajectory, without decomposition into separate stages. The optimal trajectory is calculated on the basis of the complete model of the trajectory motion of an aircraft in a vertical plane. To account for all constraints imposed by both the engineering features of the aircraft, as well as other requirements, including passenger safety and comfort, Bellman's dynamic programming method is used.

Why it matters

OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Optimization problem is solved for the trajectory of a typical medium range aircraft flying between two airdromes. The optimization is considered with respect to the fuel consumption and is performed for the entire trajectory, without decomposition into separate stages. The optimal trajectory is calculated on the basis of the complete model of the trajectory motion of an aircraft in a vertical plane. To account for all constraints imposed by both the engineering features of the aircraft, as well as other requirements, including passenger safety and comfort, Bellman's dynamic programming method is used.

Key concepts: Trajectory, Trajectory optimization, Decomposition, Fuel efficiency, Range (aeronautics), Dynamic programming, Computer science, Plane (geometry)

Related papers

Back to paper searchBrowse research topicsOriginal source
Flight trajectory optimization without decomposition into separate stages — Research Paper | ScholarLens