Optimal control based method for design and analysis of continuous descent arrivals

Abstract

Continuous Descent Arrival (CDA) is a procedure where aircraft descend, at or near idle thrust, from their cruise altitude to their Final Approach Fix without leveling off. By eliminating inefficient leveling off at low altitude, CDA provides benefits such as fuel savings, flight time savings, and the significant noise reduction near airports, but the usage of CDAs has been limited in low traffic condition due to difficulty in the separation management. For the successful CDA without degradation of the runway throughput, air traffic controllers should know the performance bound of the CDA trajectory and control the time of arrival for each aircraft, which is interpreted as Required Time of Arrival (RTA) from the aircraft standpoint. This thesis proposes a novel trajectory optimization methodology to meet RTA constraint. The CDA trajectory optimization problem in the flight management system is modeled as a path constrained optimal control problem of switched dynamical system. A sequential method that performs mode sequence estimation and parameter optimization, sequentially, is proposed to solve this problem. By analyzing the relaxed optimal solution with simplified dynamics, a computationally efficient algorithm to find the optimal switching structure is proposed and applied for the mode sequence estimation. This thesis also proposes a performance-bound analysis methodology using optimal control techniques to help controllers make a feasible schedule for CDA operations at a meter fix. The feasible time range analysis for a wide variety of aircraft is performed by using the proposed methodology. Based on the analysis result, a single flight time strategy is proposed for the application of CDA in high traffic conditions. The simulation with real traffic data has been shown that the single flight time strategy, combined with the proposed fixed RTA trajectory optimization, guarantees the conflict free CDA operation.