Two areas of the departure problem in air traffic control are discussed. The first topic is the generation of climb-out trajectories to a fix. The trajectories would be utilized by a scheduling algorithm to allocate runways, sequence the proposed departures, and assign a departure time. The second area is concerned with finding horizontal trajectories to merge aircraft from the TRACON to an open slot in the en-route environment. Solutions are presented for the intercept problem for two cases: (1) the aircraft is traveling at the speed of the aircraft in the jetway; (2) the merging aircraft has to accelerate to reach the speed of the aircraft in the en-route stream. An algorithm is given regarding the computation of a solution for the latter case. For the former, a set of equations is given that allows us to numerically solve for the coordinate where the merge will occur.
Departure Trajectory Synthesis and the Intercept Problem
AIAA Guidance, Navigation, and Control ; 1997 ; New Orleans, LA, United States
1997-07-07
Conference paper
No indication
English
Departure Trajectory Synthesis and the Intercept Problem
NTIS | 1997
|Departure trajectory synthesis and the intercept problem
AIAA | 1997
|Rapid design algorithm for intercept missile trajectory
British Library Online Contents | 2015
|Near-Earth object intercept trajectory design for planetary defense
Online Contents | 2014
|