Dynamic Airspace Configuration Using Approximate Dynamic Programming Intelligence-Based Paradigm

被引:1
|
作者
Kulkarni, Sameer [1 ]
Ganesan, Rajesh [2 ]
Sherry, Lance [1 ]
机构
[1] George Mason Univ, Ctr Air Transportat Syst Res, Fairfax, VA 22030 USA
[2] George Mason Univ, Dept Syst Engn & Operat Res, Fairfax, VA 22030 USA
基金
美国国家科学基金会;
关键词
D O I
10.3141/2266-04
中图分类号
TU [建筑科学];
学科分类号
0813 ;
摘要
On the basis of weather and high traffic, the Next Generation Air Transportation System envisions an airspace that is adaptable, flexible, controller friendly, and dynamic. Sector geometries, developed with average traffic patterns, have remained structurally static with occasional changes in geometry due to limited forming of sectors. Dynamic airspace configuration aims at migrating from a rigid to a more flexible airspace structure. Efficient management of airspace capacity is important to ensure safe and systematic operation of the U.S. National Airspace System and maximum benefit to stakeholders. The primary initiative is to strike a balance between airspace capacity and air traffic demand. Imbalances in capacity and demand are resolved by initiatives such as the ground delay program and rerouting, often resulting in systemwide delays. This paper, a proof of concept for the dynamic programming approach to dynamic airspace configuration by static forming of sectors, addresses static forming of sectors by partitioning airspace according to controller workload. The paper applies the dynamic programming technique to generate sectors in the Fort Worth, Texas, Air Route Traffic Control Center; compares it with current sectors; and lays a foundation for future work. Initial results of the dynamic programming methodology are promising in terms of sector shapes and the number of sectors that are comparable to current operations.
引用
收藏
页码:31 / 37
页数:7
相关论文
共 50 条
  • [31] Patient admission planning using Approximate Dynamic Programming
    Peter J. H. Hulshof
    Martijn R. K. Mes
    Richard J. Boucherie
    Erwin W. Hans
    Flexible Services and Manufacturing Journal, 2016, 28 : 30 - 61
  • [32] Patient admission planning using Approximate Dynamic Programming
    Hulshof, Peter J. H.
    Mes, Martijn R. K.
    Boucherie, Richard J.
    Hans, Erwin W.
    FLEXIBLE SERVICES AND MANUFACTURING JOURNAL, 2016, 28 (1-2) : 30 - 61
  • [33] Dynamic Airspace Re-configuration for Manned and Unmanned Operations in Shared Airspace
    Teutsch, Jurgen
    Petersen, Co
    2024 INTEGRATED COMMUNICATIONS, NAVIGATION AND SURVEILLANCE CONFERENCE, ICNS, 2024,
  • [34] Dynamic Energy Management for Hybrid Electric Vehicle Based on Approximate Dynamic Programming
    Li, Weimin
    Xu, Guoqing
    Wang, Zhancheng
    Xu, Yangsheng
    2008 7TH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION, VOLS 1-23, 2008, : 7864 - +
  • [35] Region-based approximation in approximate dynamic programming
    Sardarmehni, Tohid
    Song, Xingyong
    INTERNATIONAL JOURNAL OF CONTROL, 2024, 97 (02) : 306 - 315
  • [36] Microgrid Energy Management based on Approximate Dynamic Programming
    Strelec, Martin
    Berka, Jan
    2013 4TH IEEE/PES INNOVATIVE SMART GRID TECHNOLOGIES EUROPE (ISGT EUROPE), 2013,
  • [37] Dynamic Airspace Configuration: Review and open research issues
    Hind, Hassini
    El Omri, Amina
    Abghour, Noreddine
    Moussaid, Khalid
    Rida, Mohammed
    2018 4TH IEEE INTERNATIONAL CONFERENCE ON LOGISTICS OPERATIONS MANAGEMENT (GOL), 2018,
  • [38] Policy Iteration Approximate Dynamic Programming Using Volterra Series Based Actor
    Guo, Wentao
    Si, Jennie
    Liu, Feng
    Mei, Shengwei
    PROCEEDINGS OF THE 2014 INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS (IJCNN), 2014, : 249 - 255
  • [39] Dynamic Airspace Configuration: A Short Review of Computational Approaches
    Grana, Manuel
    COMPUTATIONAL COLLECTIVE INTELLIGENCE, PT I, 2019, 11683 : 486 - 497
  • [40] Empirical model based control of nonlinear processes using approximate dynamic programming
    Lee, JM
    Lee, JH
    PROCEEDINGS OF THE 2004 AMERICAN CONTROL CONFERENCE, VOLS 1-6, 2004, : 3041 - 3046