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 条
  • [41] State Aggregation based Linear Programming approach to Approximate Dynamic Programming
    Darbha, S.
    Krishnamoorthy, K.
    Pachter, M.
    Chandler, P.
    49TH IEEE CONFERENCE ON DECISION AND CONTROL (CDC), 2010, : 935 - 941
  • [42] A swarm intelligence-based approach to anomaly detection of dynamic systems
    Agharazi, Hanieh
    Kolacinski, Richard M.
    Theeranaew, Wanchat
    Loparo, Kenneth A.
    SWARM AND EVOLUTIONARY COMPUTATION, 2019, 44 : 806 - 827
  • [43] Decentralized approximate dynamic programming for dynamic networks of agents
    Lakshmanan, Hariharan
    Pucci de Farias, Daniela
    2006 AMERICAN CONTROL CONFERENCE, VOLS 1-12, 2006, 1-12 : 1648 - +
  • [44] An Approximate Dynamic Programming Approach to Dynamic Stochastic Matching
    You, Fan
    Vossen, Thomas
    INFORMS JOURNAL ON COMPUTING, 2024, 36 (04) : 1006 - 1022
  • [45] A LINEAR PROGRAMMING METHODOLOGY FOR APPROXIMATE DYNAMIC PROGRAMMING
    Diaz, Henry
    Sala, Antonio
    Armesto, Leopoldo
    INTERNATIONAL JOURNAL OF APPLIED MATHEMATICS AND COMPUTER SCIENCE, 2020, 30 (02) : 363 - 375
  • [46] The linear programming approach to approximate dynamic programming
    De Farias, DP
    Van Roy, B
    OPERATIONS RESEARCH, 2003, 51 (06) : 850 - 865
  • [47] Approximate dynamic programming via linear programming
    de Farias, DP
    Van Roy, B
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 14, VOLS 1 AND 2, 2002, 14 : 689 - 695
  • [48] Efficient approximate and dynamic matching of patterns using a labeling paradigm
    Sahinalp, SC
    Vishkin, U
    37TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1996, : 320 - 328
  • [49] Dynamic Configuration of Service based Processes in Cloud Computing using Linear Programming
    Du, Yanhua
    Li, Hong
    Ai, Lifeng
    PROCEEDINGS OF THE 10TH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION (WCICA 2012), 2012, : 3509 - 3514
  • [50] Analysis on intelligence-based innovation management paradigm
    Hou, Jianhua
    Yue, Chen
    Yun, Hui
    ISMOT'07: Proceedings of the Fifth International Symposium on Management of Technology, Vols 1 and 2: MANAGING TOTAL INNOVATION AND OPEN INNOVATION IN THE 21ST CENTURY, 2007, : 1307 - 1310