Научный вестник МГТУ ГА (Jan 2023)
Algorithmic support of the adaptive system of controlled flight into terrain avoidance (CFITA)
Abstract
The article considers the restrictions algorithms for the trajectory parameters of aircraft motion. Three groups of algorithms are under consideration. They are distinguished by the volume of airborne database about terrain, modes of aircraft operation. The first group (the full SFITA mode) uses the maximum digital cartographic information (DCI) about the terrain. In the SFITA algorithms, the terrain is approximated in the form of planes in space in some predictable, pre-emptive area in the flight path direction. Terrain following is carried out in space in the assigned direction. The equation of the adjacent plane is solved. The distance, the approach speed, and the time to reach the plane are enumerated. The net acceleration to reduce the approach speed to the plane of restriction is calculated under the specified constraint controls. The required time is calculated to reduce the approach speed towards the obstacle to zero. Having equated the expressions for the time of reaching and the required time, transition towards the distance to the plane of restriction, on which it is imperative to utilize constraint controls. The second group (the major SFITA mode) uses the DCI about the terrain in the direction of track in a pre-emptive area. The terrain is approximated by a line in the plane. The specified normal overload is used as a means of control. Terrain following is conducted in the vertical or slant planes. Subsequently, the same procedures are used as in the first group. The third group (the minimum SFITA mode) does not use DCI. The radio and barometric pressure altimeters are used as information systems about the terrain. The given SFITA mode is selected only for flights in a flat terrain. The algorithm includes the similar procedures as in the first and in the second groups. The analytical analysis, confirming the adaptive properties of algorithmic support based on the fundamental law of uniformly retarded motion, is given. The considered algorithms efficiency is confirmed by a comprehensive amount of simulation. The presented algorithms can become the foundation for developing Russian TAWS analogues.
Keywords