Optimal Arrival Traffic Spacing via Dynamic Programming

Abstract

We present the application of dynamic programming to a combinatorial optimization problem to achieve proper arrival runway spacing, which appears in the process of assigning speed during the transition to approach and approach phases of flight. We apply the algorithm to data from a fast-time simulation developed under NASA's Advanced Air Transportation Technologies Project for investigating new air traffic management (ATM) concepts. For this research, the simulation is configured to simulate traffic inbound along two arrivals to the Dallas/Ft. Worth (DFW) airport, merging into a single stream at fix just prior to the final approach fix. We show how the algorithm computes the maximum minimum spacing between aircraft upon landing, and investigate the sensitivity of the spacing to perturbations.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 2004
Accession Number
ADA515774

Entities

People

  • Alexandre M. Bayen
  • Claire J. Tomlin
  • Jiawei Zhang
  • Todd Callantine
  • Yinyu Ye

Organizations

  • Stanford University

Tags

Communities of Interest

  • Air Platforms

DTIC Thesaurus Topics

  • Aeronautics
  • Air Traffic
  • Air Transportation
  • Aircrafts
  • Algorithms
  • Commercial Aircraft
  • Computer Programming
  • Computer Science
  • Dynamic Programming
  • Engineering
  • Flight Paths
  • Guidance
  • Navigation
  • Operations Research
  • Optimization
  • Simulations
  • Unmanned Aerial Vehicles

Readers

  • Aviation Safety and Air Traffic Management
  • Operations Research

Technology Areas

  • Space