Joint Air Traffic Flow and Capacity Management via Answer Set Programming

• URL: http://arxiv.org/abs/2606.22978v1
• Date: Mon, 22 Jun 2026 07:58:54 GMT
• Title: Joint Air Traffic Flow and Capacity Management via Answer Set Programming
• Abstract summary: We introduce a joint ATFCM model with an encoding in Answer Set Programming (ASP)<n>Our results indicate that the ASP model outperforms the MIP model.<n>While DAC has the largest improvement on solving performance compared to rerouting, unrestricted variants of DAC or rerouting lead to search space thrashing.
• Score: 64.47906587579985
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Operational Air Traffic Flow and Capacity Management (ATFCM) balances flight demand with available sector capacity, to ensure safe and efficient operations. Mathematical models enhance operational ATFCM performance by framing demand-capacity balancing as an optimization problem, maximizing efficiency while adhering to safety constraints. However, SOTA research optimizes the aircraft trajectories (called ATFM) or the sector configuration (called DAC) separately. This leaves a research gap of whether joint optimization of ATFM and DAC can bring benefits. We partially address this limitation by introducing a joint ATFCM model with an encoding in Answer Set Programming (ASP). The ASP implementation is evaluated against two baselines applied to our joint model: a SOTA Mixed Integer Programming (MIP) model and an iterative CASA-based heuristic. Computational experiments utilize an instance generator fitted to historical OpenSky Network flight data. Our results indicate that the ASP model outperforms the MIP model, while ASP remains competitive against heuristics on small instances. Furthermore, while DAC has the largest improvement on solving performance compared to rerouting and delaying, unrestricted variants of DAC or rerouting lead to search space thrashing.

Related papers

• ASPaeroFlow: Decomposition Heuristics for Joint Air Traffic Flow & Capacity Management [60.85136195443409]
  We propose ASPaeroFlow: a for the joint Air Traffic Flow and Capacity Management (ATFCM)<n>It combines instance-space decompositions with a local exact approach using Answer Set Programming.<n>We benchmark ASPaeroFlow from small to industry-sized instances and compare it with exact and alternative approaches.
  arXiv  Detail & Related papers  (2026-08-10T08:57:18Z)
• Fine-Tuning Large Language Models for Cooperative Tactical Deconfliction of Small Unmanned Aerial Systems [3.3091223236295213]
  Small Unmanned Aerial Systems (sUASs) in low-altitude airspaces have increased the need for reliable tactical deconfliction under safety-critical constraints.<n>This paper investigates Large Language Models (LLMs) as decision-makers in cooperative multi-agent tactical deconfliction using fine-tuning strategies.
  arXiv  Detail & Related papers  (2026-03-30T15:22:27Z)
• Efficient Onboard Vision-Language Inference in UAV-Enabled Low-Altitude Economy Networks via LLM-Enhanced Optimization [61.55616421408666]
  Low-Altitude Economy Networks (LAENets) have enabled a variety of applications, including aerial surveillance, environmental sensing, and semantic data collection.<n> onboard vision (VLMs) offer inference for real-time inference but limited onboard dynamic network conditions.<n>We propose a UAV-enabled LAENet system that improves communication efficiency under dynamic LAENet conditions.
  arXiv  Detail & Related papers  (2025-10-11T05:11:21Z)
• Joint Channel Estimation and Computation Offloading in Fluid Antenna-assisted MEC Networks [81.36647816787713]
  We propose an FA-assisted offloading framework to minimize the delay of channel estimation.<n>We show that the proposed system significantly reduces the accuracy under efficient communication.
  arXiv  Detail & Related papers  (2025-09-16T08:48:44Z)
• AirLLM: Diffusion Policy-based Adaptive LoRA for Remote Fine-Tuning of LLM over the Air [14.089748643405498]
  AirLLM is a hierarchical diffusion policy framework for communication-aware LoRA adaptation.<n>AirLLM consistently enhances fine-tuning performance while significantly reducing transmission costs.
  arXiv  Detail & Related papers  (2025-07-15T17:36:37Z)
• Streaming Looking Ahead with Token-level Self-reward [50.699168440048716]
  We propose a policy model with token-level self-reward modeling (TRM) capability to eliminate the need for external models and extra communication.<n>In addition, we propose a streaming-looking-ahead (SLA) algorithm to further boost search efficiency with better parallelization.<n>If we combine SLA with reinforcement fine-tuning techniques such as DPO, SLA achieves an overall win rate of 89.4%.
  arXiv  Detail & Related papers  (2025-02-24T22:35:53Z)
• A Hybrid Tabu Scatter Search Algorithm for Simulation-Based Optimization of Multi-Objective Runway Operations Scheduling [0.0]
  dissertation addresses the challenge of air traffic flow management by proposing a simulation-based optimization (SbO) approach for runway operations scheduling.<n>The goal is to optimize airport capacity utilization while minimizing delays, fuel consumption, and environmental impacts.<n>The proposed SbO framework integrates a discrete-event simulation model to handle runway conditions and a hybrid Tabu-Scatter Search algorithm to identify optimal solutions.
  arXiv  Detail & Related papers  (2025-02-08T14:42:05Z)
• Over-the-Air Fair Federated Learning via Multi-Objective Optimization [52.295563400314094]
  We propose an over-the-air fair federated learning algorithm (OTA-FFL) to train fair FL models.<n>Experiments demonstrate the superiority of OTA-FFL in achieving fairness and robust performance.
  arXiv  Detail & Related papers  (2025-01-06T21:16:51Z)
• A Graph-based Adversarial Imitation Learning Framework for Reliable & Realtime Fleet Scheduling in Urban Air Mobility [5.19664437943693]
  This paper presents a comprehensive optimization formulation of the fleet scheduling problem. It also identifies the need for alternate solution approaches. The new imitative approach achieves better mean performance and remarkable improvement in the case of unseen worst-case scenarios.
  arXiv  Detail & Related papers  (2024-07-16T18:51:24Z)
• Model-based Causal Bayesian Optimization [74.78486244786083]
  We introduce the first algorithm for Causal Bayesian Optimization with Multiplicative Weights (CBO-MW) We derive regret bounds for CBO-MW that naturally depend on graph-related quantities. Our experiments include a realistic demonstration of how CBO-MW can be used to learn users' demand patterns in a shared mobility system.
  arXiv  Detail & Related papers  (2023-07-31T13:02:36Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.