Optimization of standard arrival procedures at Sheremetyevo airport using rnav path terminators

Holding patterns are established at international airports to make the arriving traffic flow smooth and efficient. One of the main aims of holding patterns is to extend the aircraft arrival route, which allows ATC units to arrange the sequence on the arrival routes more effectively. The article considers the current methods and offers new ideas to improve the efficiency of the inbound traffic flow management using Paths and Terminators concept with HA holding patterns for standard arrival routes at Sheremetyevo Airport. As the main idea for optimizing air traffic management on this stage and reducing the workload on the controller, it is proposed to create extra routes in addition to the existing ones which include holding patterns, that will be used when needed to ensure a well-ordered traffic. The probabilistic method is used to calculate the maximum capacity of existing and proposed arrival routes with holding patterns. The proposed options for restructuring the airspace of the Moscow Terminal Control Area with preserving waypoints of starting standard arrival routes are presented.

The flight efficiency analysis on the Multi-Arrival Route Point Merge System

This study proposes a new operational concept of the Point Merge System, called Multi-Arrival Route Point Merge System (MAR-PMS), which is an air traffic control method used to sequence aircraft arrivals in a given terminal control area. The proposed concept enables the additional arrival routes that have an angular difference to each sequencing leg. Furthermore, a time-indexed 0-1 linear programming model is formulated. The obtained results are validated in a real time simulation. The comparison results of PMS and MAR-PMS show that the average reduction of 19% of total flight time, 23% of total flight distance, and 19% in total fuel burned and reduction in CO2 emissions in favor of a proposed concept.

STABILIZATION OF THE SPATIAL POSITION OF THE MANIPULATOR OF A PARALLEL-SEQUENTIAL STRUCTURE

A method for constructing terminal control based on the representation of control functions relative to time is considered. The parameters of the functions are determined from the condition of satisfying the boundary conditions at the ends of the trajectory of the generalized coordinates of the manipulator. On the basis of the obtained program movements, a control law with feedbacks is constructed.

Airspace design for integrating RPAS into terminal airspace

Purpose This paper aims to analyse remotely piloted aircraft system (RPAS) integration in non-segregated terminal airspace. This work aims to identify the potential airspace volumes where a free operation of RPAS can be developed by analysing the airspace design of the terminal airspace. Design/methodology/approach The methodology considers five crucial elements of the airspace design: obstacles, prohibited, restricted and dangerous zones, aerodrome zones, departing and arriving procedures and visual corridors. Free operation of RPAS is performed in those airspace volumes that no interaction with instrumental flight rules (IFR) flights is expected. Free RPAS airspace volumes are separated through current IFR separation minima. Findings The results show there is a significant amount of available airspace that RPAS can operate without interaction with conventional aircraft. The more significant risks are allocated by the limitations imposed by departing and arriving procedures in the terminal airspace. Research limitations/implications The methodology is applied to medium-dense terminal airspace. This work assumes RPAS can perform visual or instrumental flights. Originality/value RPAS is a capital issue for the majority of aviation actors. This work underlay the further development of a methodology regarding airspace design for RPAS in a terminal control area.

Algorithm for solving optimal open-loop terminal control problem for spacecraft rendezvous with account of constraints on the state

The paper proposes an algorithm for solving the optimal open-loop terminal control problem of two spacecraft rendezvous with constraints on their states. A system of nonlinear differential equations that describes the dynamics of the active (maneuvering) spacecraft relative to the passive spacecraft (station) in the central gravitational field of the Earth in the orbital coordinate system of coordinates related to the passive spacecraft center-of-mass is considered as an initial model. The obtained nonlinear model of the active spacecraft dynamics is linearized relative to the specified reference state trajectory of the passive spacecraft, and then it is discretized and reduced to linear recurrence relations. Mathematical formalization of the spacecraft rendezvous problem under consideration is carried out at a specified final moment of time for the obtained discrete-time controlled dynamical system. The quality of solving the problem is estimated by a convex functional taking into account the geometric constraints on the active spacecraft states and the associated control actions in the form of convex polyhedral-compacts in the appropriate finite dimensional vector space. We propose a solution of the problem of optimal terminal control over the approach of the active spacecraft relative to the passive spacecraft in the form of a constructive algorithm on the basis of the general recursive algebraic method for constructing the availability domains of linear discrete controlled dynamic systems, taking into account specified conditions and constraints, as well as using the methods of direct and inverse constructions. In the final part of the paper, the computer modeling results are presented and conclusions about the effectiveness of the proposed algorithm are made.

Modeling and optimization of the terminal control area with holding unit

Aiming at the problem of resource allocation for departure flights at congested airports, this research explores the optimal configuration of holding units in the terminal control area (TCA). Similar to the job-shop scheduling problem, this problem is solved through a max-plus model with additional constraints. In particular, two optimization models are constructed, in which air segments, departure fixes and holding units are explicitly modeled. Based on the realistic airspace network selected, the proposed models are tested using actual flight data. The experimental results show that the models proposed have better qualities compared with the other methods.