About: Initial approach fix is a research topic. Over the lifetime, 29 publications have been published within this topic receiving 227 citations. The topic is also known as: IAF.
TL;DR: In this paper, the authors propose a methodology to generate aircraft-specific dynamic CDA routes that are both laterally and vertically optimized on given objectives (noise, emission and fuel) from an Initial Approach Fix (IAF) to Final Approach Fix(FAF).
Abstract: Continuous Descent Approaches (CDAs) can significantly reduce fuel burn and noise impact by keeping arriving aircraft at their cruise altitude for longer than during conventional approaches(to descend as late as possible)and then having them make a continuous descent to the runway at near idle thrust with no level flight segments. The CDA procedures are fixed routes that are vertically optimized. With the changing traffic conditions and variable noise abatement rules the benefits of CDA operations are not yet fully realized. In this paper we propose a methodology to generate aircraft-specific dynamic CDA routes that are both laterally and vertically optimized on given objectives (noise, emission and fuel) from an Initial Approach Fix (IAF) to Final Approach Fix (FAF). The methodology utilizes real-time aircraft position and defined objectives to generate CDA routes which can then be converted into a set of artificial waypoints for continuous descent in transition airspace. The methodology involves discretizing the terminal airspace into concentric cylinders with artificial waypoints and uses enumeration and elimination (based on aircraft performance envelope) from one waypoint to other to identify all the possible routes. For each transition a variety of metrics including noise, emission and fuel burn are computed. From the resulting set of possible CDA routes, those routes are identified that represent the best trade-off on the given objectives. One of these routes is then used to dynamically update the flight route for executing the CDA procedure. For noise we used The Overall Sound Pressure Level (OPSL) and for emissions we used four pollutants HC, CO, CO 2 and NO x . The dynamic CDA algorithm is implemented in a high-fidelity simulator ATOMS for Sydney Terminal Area with 34L as arrival runway for a Melbourne-Sydney flight (B737–400 aircraft, CFM56–3C–1 engines with a nominal weight of 58000 kg). The dynamic CDA routes are then compared on noise, emission and fuel burn with same flight conducting a typical CDA procedure (MANFA ONE Arrival) at the Sydney airport. The results shows that the methodology generates 64 possible solutions (dynamic CDA routes) from IAF to FAF in the transition airspace, of which 5 solutions were non-dominated. Dynamic CDA approach shows a reduction of 14.96% in noise, 11.6% reduction in NO x emission and 1.5% reduction in fuel burn when compared to a standard CDA trajectory. The paper also investigates the throughput capacity of transition airspace for multiple flights performing CDA operation. The methodology incorporates a delay algorithm which uses the flights' estimated time of arrival (ETA) at the IAF and then allocates them a conflict free CDA route by searching through available routes. The approach takes into account the aircraft category and corresponding time occupancy at each artificial waypoint of the proposed CDA routes and propagate delays back when conflict exists.
TL;DR: In this paper, the authors focused on controlled time of arrival updates once the descent has been already initiated, assessing the feasible time window and associated fuel consumption of continuous descent operations requiring neither thrust nor speed-brake usage along the whole descent (i.e. only elevator control is used to achieve different metering times).
Abstract: Continuous descent operations with controlled times of arrival at one or several metering fixes could enable environmentally friendly procedures without compromising terminal airspace capacity. This paper focuses on controlled time of arrival updates once the descent has been already initiated, assessing the feasible time window (and associated fuel consumption) of continuous descent operations requiring neither thrust nor speed-brake usage along the whole descent (i.e. only elevator control is used to achieve different metering times). Based on previous works, an optimal control problem is formulated and numerically solved. The earliest and latest times of arrival at the initial approach fix have been computed for the descent of an Airbus A320 under different scenarios, considering the potential altitudes and distances to go when receiving the controlled time of arrival update. The effects of the aircraft mass, initial speed, longitudinal wind and position of the initial approach fix on the time window have been also investigated. Results show that time windows about three minutes could be achieved for certain conditions, and that there is a trade-off between robustness facing controlled time of arrival updates during the descent and fuel consumption. Interestingly, minimum fuel trajectories almost correspond to those of minimum time.
TL;DR: The optimal trajectory generation method is proposed, in which the optimal trajectory is generated by the backward and forward integration, and the trajectory from the proposed algorithm is compared to the numerical optimal solution of the original optimal control problem.
Abstract: The vertical trajectory optimization for the en route descent phase is studied in the presence of both along-track and cross winds, which are both modeled as functions of altitude. The flight range covers some portion of a cruise segment and ends at a meter fix. The descent trajectory is assumed as a flight idle descent. The problem is formulated as an optimal control problem with both mixed state path constraints and pure state constraints. For minimizing environmental impacts, we optimize descent trajectory with respect to two cost functionals: fuel and emissions costs. We analyze both singular arc and boundary arc using the necessary conditions of the optimality. From the analysis result, we propose the optimal trajectory generation method, in which the optimal trajectory is generated by the backward and forward integration. The trajectory from the proposed algorithm is compared with the numerical optimal solution of the original optimal control problem. The result shows that the proposed algorithm gen...
TL;DR: In this paper, NASA has developed an advanced arrival management capability for terminal controllers, known as Terminal Sequencing and Spacing (TSAS), which increases use of performance-based navigation (PBN) arri...
Abstract: NASA has developed an advanced arrival management capability for terminal controllers, known as Terminal Sequencing and Spacing (TSAS). TSAS increases use of performance-based navigation (PBN) arri...
TL;DR: The arrival manager operational horizon, in Europe, is foreseen to be extended up to 500 n miles around destination airports, in this context, arrivals need to be sequenced and scheduled a few hourly.
Abstract: The arrival manager operational horizon, in Europe, is foreseen to be extended up to 500 n miles around destination airports. In this context, arrivals need to be sequenced and scheduled a few hour...