Abstract: A system and method are provided for generating a flight plan between an initial position and a destination. An input device is configured to receive inputs related to the destination; a memory configured to store data related to the destination; and a processor is configured to retrieve data from the memory and to generate the flight plan from the initial position to the destination. The flight plan includes a plurality of legs and an initial plurality of transitions between the legs. The processor is further configured to determine whether each of the initial plurality of transitions between the legs are flyable and to provide a flyable transition between the legs if the transition is not flyable.

Abstract: A system and method are provided for generating a flight plan between an initial position and a destination. An input device is configured to receive inputs related to the destination; a memory configured to store data related to the destination; and a processor is configured to retrieve data from the memory and to generate the flight plan from the initial position to the destination. The flight plan includes a plurality of legs and an initial plurality of transitions between the legs. The processor is further configured to determine whether each of the initial plurality of transitions between the legs are flyable and to provide a flyable transition between the legs if the transition is not flyable.

Abstract: The present invention provides a set of holding pattern entry algorithms used to define flight segments for entry into holding patterns. These geometries preferably describe the specific location and distance of various segments used in the holding pattern and holding pattern racetrack, with each segment defined as a curved or straight segment between endpoints. The algorithms also preferably include criteria used to determine entry extension, maximum initial turn angle, and minimum distance between a hold fix and an entry turn point. The geometry also preferably extends entry distance to avoid excessive iterative calculations. The algorithms are preferably utilized by a flight management system and method that determines segment sequencing during entry into holding patterns and the holding patterns themselves.

Abstract: The present invention provides a set of holding pattern entry algorithms used to define flight segments for entry into holding patterns. These geometries preferably describe the specific location and distance of various segments used in the holding pattern and holding pattern racetrack, with each segment defined as a curved or straight segment between endpoints. The algorithms also preferably include criteria used to determine entry extension, maximum initial turn angle, and minimum distance between a hold fix and an entry turn point. The geometry also preferably extends entry distance to avoid excessive iterative calculations. The algorithms are preferably utilized by a flight management system and method that determines segment sequencing during entry into holding patterns and the holding patterns themselves.

Abstract: The instant invention provides a system and method for controlling the flight of an aircraft to meet an RTA. The system comprises a speed profile generator that communicates with a trajectory generator to produce a speed profile signal that enables the aircraft to reach a waypoint substantially at a predetermined time. In the system of the instant invention, the speed profile generator receives a nominal speed command signal, a time error signal and a sensitivity signal. Based on these inputs, the speed profile generator produces a speed profile signal. The trajectory generator receives the speed profile signal and a required time of arrival signal. Based on these signals, the trajectory generator produces a time error signal and a sensitivity signal. This sensitivity signal represents the sensitivity of the time error signal to changes in the speed profile signal.