Importance

Loading Importance Indicators...

Abstract

A system and method for determining the optimal path for an aircraft to fly from a first position to a second position so that the aircraft heading at the second position is within preselected minimum and maximum heading limits. A two-dimensional reference grid is constructed so that the first position is in the center cell of the first rank of the grid and the second position is adjacent to the center cell of the last rank thereof. Dynamic programming techniques are used to determine the possible flight paths between the first and second positions and to select the path of minimum cost as the optimal path. The possible flight paths are constructed by identifying the possible connections between the last rank and the second postion and then between each pair of adjacent ranks, working backward from the last rank to the first position, which is located in the first rank. A possible connection is deemed to exist when the aircraft can fly from one point to a target point (e.g., between specified cells in adjacent ranks) and arrive at the target point within particular heading limits without exceeding the predetermined maximum lateral acceleration of the aircraft. Corresponding heading limits are determined for each 'connected' cell in the grid, so that all possible flight paths are examined, consistent with the preselected heading limits at the second position (e.g., the target area) and the maximum lateral acceleration allowed for the aircraft.

Loading the Abstract Image...

First Claim