Research Papers

Efficient Computation of Separation-Compliant Speed Advisories for Air Traffic Arriving in Terminal Airspace

[+] Author and Article Information
Alexander V. Sadovsky

NASA Ames Research Center,
Moffett Field, CA 94035
e-mail: alexander.v.sadovsky@nasa.gov

Damek Davis

Department of Mathematics,
Los Angeles, CA 90095-1555

Douglas R. Isaacson

NASA Ames Research Center,
Moffett Field, CA 94035

1Corresponding author.

Contributed by the Dynamic Systems Division of ASME for publication in the JOURNAL OF DYNAMIC SYSTEMS, MEASUREMENT, AND CONTROL. Manuscript received February 2, 2012; final manuscript received February 21, 2014; published online May 8, 2014. Editor: J. Karl Hedrick.

J. Dyn. Sys., Meas., Control 136(4), 041027 (May 08, 2014) (10 pages) Paper No: DS-12-1043; doi: 10.1115/1.4026957 History: Received February 02, 2012; Revised February 21, 2014

A class of problems in air traffic management (ATM) asks for a scheduling algorithm that supplies the air traffic services authority not only with a schedule of arrivals and departures but also with speed advisories. Since advisories must be finite, a scheduling algorithm must ultimately produce a finite data set, hence must either start with a purely discrete model or involve a discretization of a continuous one. The former choice, often preferred for intuitive clarity, naturally leads to mixed-integer programs (MIPs), hindering proofs of correctness and computational cost bounds (crucial for real-time operations). In this paper, a hybrid control system is used to model air traffic scheduling, capturing both the discrete and continuous aspects. This framework is applied to a class of problems, called the fully routed nominal problem. We prove a number of geometric results on feasible schedules and use these results to formulate an algorithm that attempts to compute a collective speed advisory, effectively piecewise linear with finitely many vertices, and has computational cost polynomial in the number of aircraft. This work is a first step toward optimization and models refined with more realistic detail.

Copyright © 2014 by ASME
Your Session has timed out. Please sign back in to continue.


Carr, G. C., Erzberger, H., and Neuman, F., 1999, “Delay Exchanges in Arrival Sequencing and Scheduling,” J. Aircr., 36, pp. 785–791. [CrossRef]
Bayen, A., Tomlin, C., Ye, Y., and Zhang, J., 2003, “An Approximation Algorithm for Scheduling Aircraft with Holding Time,” IEEE Conference on Decision and Control (CDC).
Roy, K., Bayen, A., and Tomlin, C., 2005, “Polynomial Time Algorithms for Scheduling of Arrival Aircraft,” AIAA Guidance, Navigation, and Control Conference and Exhibit.
Bianco, L., Dell'Olmo, P., and Giordani, S., 2006, “Scheduling Models for Air Traffic Control in Terminal Areas,” J. Scheduling, 9(3), pp. 223–253. [CrossRef]
Balakrishnan, H., and Chandran, B., 2006, “Scheduling Aircraft Landings Under Constrained Position Shifting,” AIAA Guidance, Navigation, and Control Conference and Exhibit, Keystone, CO.
Lee, H., and Balakrishnan, H., 2008, “A Study of Tradeoffs in Scheduling Terminal-Area Operations,” Proc. IEEE, 96(12), pp. 2081–2095. [CrossRef]
Chipalkatty, R., Twu, P., Rahmani, A., and Egerstedt, M., 2010, “Distributed Scheduling for Air Traffic Throughput Maximization During the Terminal Phase of Flight,” 49th IEEE Conference on Decision and Control (CDC), pp. 1195–1200.
US Department of Transportation, 2010, “Order JO 7110.65T, Air Traffic Control,” Federal Aviation Administration, Washington, DC.
Bradley, S., Hax, A., and Magnanti, T., 1977, Applied Mathematical Programming, Addison Wesley.
Vazirani, V. V., 2004, Approximation Algorithms, Springer, New York.
Bayen, A. M., Zhang, J., Tomlin, C. J., and Ye, Y., 2003, “MILP Formulation and Polynomial Time Algorithm for an Aircraft Scheduling Problem,” Proc., 42nd IEEE Conference on Decision and Control, Dec. 9–12, Vol. 5, pp. 5003–5010. [CrossRef]
Sadovsky, A. V., Davis, D., and Isaacson, D. R., 2013, “Separation-Compliant, Optimal Routing and Control of Scheduled Arrivals in a Terminal Airspace,” Transport. Res. C: Emerging Tech. J., 37, pp. 157–176. [CrossRef]
Sussmann, H. J., 1999, “A Maximum Principle for Hybrid Optimal Control Problems,” 38th IEEE Conference on Decision and Control, pp. 425–430.
Sussmann, H. J., 1999, “A Nonsmooth Hybrid Maximum Principle,” The First European Community Nonlinear Control Network Workshop on Stability and Stabilization, pp. 325–354.
Tomlin, C., Mitchell, I., Bayen, A. M., and Oishi, M., 2003, “Computational Techniques for the Verification of Hybrid Systems,” Proc. IEEE, 91(7), pp. 986–1001. [CrossRef]
Branicky, M., 2005, “Introduction to Hybrid Systems,” Handbook of Networked and Embedded Control Systems, D.Hristu-Varsakelis and W. S.Levine (eds.), Birkhauser, Boston, pp. 91–116.
Simic, S., Johansson, H., Sastry, S., and Lygeros, J., 2000, “Towards a Geometric Theory of Hybrid Systems,” Hybrid Systems: Computation and Control, Lecture Notes in Computer Science, Vol. 1790, pp. 421–436.
Dmitruk, A., and Kaganovich, A., 2008, “The Hybrid Maximum Principle is a Consequence of Pontryagin Maximum Principle,” Syst. Control Lett., 57(11), pp. 964–970. [CrossRef]
Passenberg, B., Caines, P. E., Sobotka, M., Stursberg, O., and Buss, M., 2010, “The Minimum Principle for Hybrid Systems With Partitioned State Space and Unspecified Discrete State Sequence,” Proceedings of the 49th IEEE Conference on Decision and Control.
Sethian, J., and Vladimirsky, A., 2002, “Ordered Upwinds Methods for Hybrid Control,” Proceedings Fifth International Conference on Hybrid Systems and Control, LCNS 2289.
Isaacson, D. R., Robinson, J. E., III, and Swenson, H., and Denery, D., 2010, “A Concept for Robust, High Density Terminal Air Traffic Operations,” 10th AIAA Aviation Technology, Integration, and Operations (ATIO) Conference, Fort Worth, TX.
Swenson, H. N., Hoang, T., Engelland, S., Vincent, D., Sanders, T., Sanford, B., and Heere, K., 1997, “Design and Operational Evaluation of the Traffic Management Advisor at the Fort Worth,” 1st USA/Europe Air Traffic Management R&D Seminar, Saclay, France, pp. 17–19.
Love, D., Horn, W., and Fellman, L., 2002, “An Evaluation of the Use of the URET Prototype Tool at Indianapolis and Memphis Air Route Traffic Control Centers, Using Benefit Metrics,” Digital Avionics Systems Conference, 21st Proceedings, Vol. 1, pp. 1A1–1–1A1–12.
Neuman, F., and Erzberger, H., 1991, “Analysis of Delay Reducing and Fuel Saving: Sequencing and Spacing Algorithms for Arrival Traffic,” NASA TM-103880.
Sadovsky, A., Swenson, H., Haskell, W., and Rakas, J., 2011, “Optimal Time Advance in Terminal Area Arrivals: Throughput vs. Fuel Savings,” 30th Digital Avionics Systems Conference (DASC), Seattle, WA.
Isaacson, D. R., Sadovsky, A. V., and Davis, D., “Tactical Scheduling for Precision Air Traffic Operations: Past Research and Current Problems,” AIAA J. Aerosp. Info. Sys. (to appear).
Joint Planning and Development Office, 2007, “Concept of Operations for the Next Generation Air Transportation System,” Version 2.0.
Papadimitriou, C. H., and Steiglitz, K., 1998, Combinatorial Optimization; Algorithms and Complexity, Dover, New York.
Korn, G., and Korn, T., 1961, Mathematical Handbook for Scientists and Engineers: Definitions, Theorems, and Formulas for Reference and Review, McGraw-Hill, New York.
Ghrist, R., O'Kane, J. M., and LaValle, S. M., 2005, “Computing Pareto Optimal Coordinations on Roadmaps,” Int. J. Rob. Res., 24(11), pp. 997–1010. [CrossRef]
Adams, C., and Franzosa, R., 2008, Introduction to Topology: Pure and Applied, Pearson, Upper Saddle River, NJ.
Arnol'd, V., 1997, Mathematical Methods of Classical Mechanics, 2nd ed., Springer, New York.
Jung, J. B., and Ghrist, R., 2008, “Pareto Optimal Multi-Robot Coordination With Acceleration Constraints,” IEEE International Conference on Robotics and Automation, ICRA 2008, pp. 1942–1947. [CrossRef]
Sadovsky, A., “Application of the Shortest-Path Problem to Routing Terminal Airspace Air Traffic,” AIAA J. Aerosp. Inf. Syst. (to be published).
Cormen, T., Leiserson, C., and Rivest, R., 1990, Introduction to Algorithms, MIT, Cambridge, MA.
Bryson, A. E., and Ho, Y. C., 1969, Applied Optimal Control, Blaisdell, New York.
ARINC, T. C. G., 2011, “424-20 Navigation System Database.”


Grahic Jump Location
Fig. 1

A portion of the LAX terminal airspace for arriving traffic. The thin arrows indicate the traffic directions.

Grahic Jump Location
Fig. 2

Examples of three discrete modes with edge set E = {e1, e2,…, e6} and moving agent set A = {1,2,3} (A = 3). The agents are shown as numbered gray squares. The discrete modes shown are: (a) μ1:μ1(1) = e1,μ1(2) = e1,μ1(3) = e4; (b) μ2:μ2(1) = e1,μ2(2) = e2,μ2(3) = e4; (c) μ3:μ3(1) = e1,μ3(2) = e3,μ3(3) = e4.

Grahic Jump Location
Fig. 3

(a)–(c) The continuous state spaces Xμ1,Xμ2,Xμ3 corresponding to discrete modes μ1, μ2, μ3 from Fig. 2. Among the discrete modes the system may enter from μ1 are μ2 and μ3, accordingly as agent 2 enters e2 or e3. Conflicting states not shown. (d) A gluing of Xμ1 to Xμ2 and to Xμ3 (see Fig. 3). Glued, all three state spaces share a face, but no two have any other points in common. Conflicting states not shown.

Grahic Jump Location
Fig. 4

Agents 1, 2 on their respective rectilinear edges e1,e2, which share a common vertex, taken as the origin 0 in R2. The orientation of the edges is not specified. (a) The unit vectors a1,a2 are collinear with the respective edges, but their directions do not necessary agree with the edges' orientations. (b) With suitably chosen scalars coefficients c1,c2, the vectors c1a1 and c2a2 are the respective position vectors of the two agents.

Grahic Jump Location
Fig. 5

(a) An example of two elliptical sectors in the c1c2-plane corresponding to conflicting states. (b) An example of two stripes in the c1c2-plane corresponding to conflicting states of two agents on the same edge.

Grahic Jump Location
Fig. 6

An example of two agents whose paths overlap. The black star shows the beginning of the overlap in (a) and the corresponding state (both agents being at that point) in (b); the white star, the end of the overlap in (a) and the corresponding state (both agents being at that point) in (b). The system, shown in (a), has seven discrete modes with both agents in the transportation network. Each mode's set of separation-violating states, shown in (b) as a connected [31] gray region, is “glued” to some of the others. The result of the gluing is the connected region shown in (c).

Grahic Jump Location
Fig. 7

The case of A = 3 aircraft: (a) the distal edges and the target set and (b) an illustration of the distal boundary

Grahic Jump Location
Fig. 8

The shaded regions are the orthogonal projections of the half-spaces (a) Hα1,α2;-1, (b) Hα1,α2;+1, and (c) Fα1,α2 onto the yα1yα2-plane. Their intersection is the polygonal approximation, shown in Fig. 8(d), of the conflict zone for α1,α2. (d) An approximation of a pairwise conflict zone (Fig. 6(c)) by a polygonal region equal to the intersection of three half-planes. (e) The geometry of the safe wedges (shaded) and DICPs.

Grahic Jump Location
Fig. 9

An example with two aircraft. The conflict zone is as in Fig. 8(d). (a) A collective state trajectory y(t), with initial state y(0) = y0. (b) The cone of attainability C(y0) (shown in the lighter shade) at y0. (c) The cone is positioned so that there are no feasible solutions.

Grahic Jump Location
Fig. 10

An example with A = 3 aircraft (compare with Fig. 7). There are (A2) = 3 conflict zones. The orthogonal projection of zone Zα1,α2 onto the yα1yα1-coordinate plane (onto the appropriate face of the parallelotope) has the form shown, as a shaded region, in Fig. 9(a).

Grahic Jump Location
Fig. 11

An example illustrating Lemma 6.5. There are A = 3 aircraft, and the initial state y0 lies in a safe wedge. By going from y0 in the direction d, one reaches the distal boundary (in state p) without running into a conflict zone.

Grahic Jump Location
Fig. 12

An example, with A = 3 aircraft, illustrating the algorithm. In steps 4 and 5, one finds a DICP p closest to y0 and proceeds from p along the direction of −d until reaching a state y1 on the boundary of C(y0). The segment y0y1 may or may not be feasible. The latter case is illustrated in (a) (the infeasible part of y0y1 is shown dashed) and is handled by step 7, which is illustrated in (b). If y0y1 had turned out feasible, the piecewise linear trajectory y0y1p would have constituted a first portion of a solution, and this would have been detected and handled in step 6.

Grahic Jump Location
Fig. 13

The initial state of a traffic scenario for 23 aircraft. To capture airspace adequately, an aspect ratio different from 1 is used. The thin arrows indicate the directions of the traffic.




Some tools below are only available to our subscribers or users with an online account.

Related Content

Customize your page view by dragging and repositioning the boxes below.

Related Journal Articles
Related eBook Content
Topic Collections

Sorry! You do not have access to this content. For assistance or to subscribe, please contact us:

  • TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
  • EMAIL: asmedigitalcollection@asme.org
Sign In