Merging Optimization Method with Multiple Entry Points for Extended Terminal Maneuvering Area

International audienceTo implement the Continuous Descend Operation (CDO) to the high-density flow, Flight-deck Interval Management (FIM) is proposed by some researchers. To enhance the FIM, the merging optimization method with the multiple entry points for the Extended Terminal Maneuvering Area (E-TMA) is developed in this study. The simultaneous optimization method for trajectory and sequence is employed as the merging optimization method. The simultaneous optimization method is able to optimize the trajectory and the sequence simultaneously by introducing the criterion function which expresses the relation between the terminal time and the value of the criterion of the trajectory. However, the simultaneous optimization method for trajectory and sequence is not enough for the merging optimization method for the E-TMA, because aircraft enter the TMA from some entry points to merge the arrival flow, and the previous method is able to treat only one merging point. To enable the simultaneous optimization method to treat the multiple entry points, the criterion function is modified in this paper. The ability of the proposed method is demonstrated by the simulations. The simulation results show the merging optimization method is able to optimize the merging with the multiple entry points

Generation of RNP approach flight procedures with an RRT* path-planning algorithm

© 2023 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes,creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.We present a framework capable of generating required navigation performance authorization required approach (RNP AR APCH) procedures by using a combination of the optimal version of the path-planning rapidly-exploring random tree (RRT*) algorithm and Dubins paths. Procedures are generated by taking into account design constraints defined by the international civil aviation organization (ICAO) procedures for air navigation services - aircraft operations (PANS-OPS). The framework is used to compute several approach procedures for two airports in Japan, Kumamoto and Kitakyushu airports. Several feasible procedures are successfully obtained in a low amount of computational time, many of them resembling the actual procedures published in the selected airports. The output of our framework represents a valuable input for procedure designers, who could later refine the obtained results with specific flight-procedure-design software.Peer ReviewedPostprint (author's final draft

Effects on Optimal Merging Trajectories with Allocation Optimization from the Trade-off between Fuel Consumption and Flight Time

This study investigates the effects of the trade-off between fuel consumption and flight time on optimal merging trajectories with allocation optimization. A merging optimization method that simultaneously optimizes arrival trajectories and the sequence of aircraft has the potential to improve future decision support systems for air traffic control. In addition, the merging optimization method is required to optimize allocation of the arrival aircraft to parallel runways because most large-scale airports have parallel runways. The merging optimization method with allocation optimization has been developed in previous studies, but only fuel consumption was minimized. Furthermore, in practice, the total flight time must be minimized, and it is possible that the trade-off between minimizing fuel consumption and flight time affects the optimal solution of the merging trajectory. Numerical simulations are performed to demonstrate the variation of the optimal merging trajectory. In particular, this study focuses on the variation of allocation of aircraft, which is a discrete factor in the merging optimization problem. The simulation results show that the allocation of aircraft can change due to the trade-off between minimizing fuel consumption and flight time. The optimality of the allocation is confirmed by comparing with the simulation results with specified allocation