Flight trajectory optimization without decomposition into separate stages
S. A. Kumakshev, A. M. Shmatkov
Abstract
Open-access reader
S. A. Kumakshev, A. M. Shmatkov
Abstract
Open-access reader
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.
OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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)