EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Receding-Horizon Engagement Scheduling for Layered Air-Defense Under Operational Uncertainty

Ha-Min Jeon, Hyoung do Choi, Jiwoo Choi, Junseok Kim, Nana Shin

IEEE Access · 2026 · 14 · 125046-125061

DOI: 10.1109/access.2026.3722946 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEEE Access, 2026. Verfasst von Ha-Min Jeon und 4 weiteren Autor:innen. Die Arbeit nennt 22 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Layered air-defense operations require dynamic engagement scheduling beyond static weapon–target assignment because launch delay, flyout time, kill-assessment delay, resource occupation, finite ammunition inventory, and uncertain engagement conditions interact over time. This study formulates an execution-consistent receding-horizon engagement scheduling problem for layered engagement-control-system (ECS)/launcher resources with finite interceptor inventories. A target-priority greedy (TPG) scheduler is proposed to generate feasible engagements using a marginal score that combines shoot delay, interceptor cost, time-window margin, log-kill deficit reduction, and schedule consistency. The framework explicitly separates nominal planning from realized execution to account for execution uncertainty. The proposed scheduler is compared with candidate-pool greedy and mixed-integer linear programming (MILP) policies under the same candidate-generation model, objective structure, and matched Monte Carlo uncertainty realizations. Across six main Monte Carlo cases with 250 replications each, closed-loop (CL) TPG reduces terminal residual threat by 54.2% relative to open-loop TPG on an aggregate-mean basis. Closed-loop MILP with schedule-consistency weight (CL-MILP-SW) remains the stronger deterministic nominal optimizer, giving lower residual threat in five of six cases and a lower plan-objective value in all cases. However, closed-loop TPG with schedule-consistency weight (CL-TPG-SW) maintains a limited case-wise average residual-threat gap of 11.05% while providing substantially lower computation time. Its six-case average mean solver time is 41.43 ms, compared with 1059.21 ms for CL-MILP-SW, and it has no observed deadline overrun under the 1000 ms replanning interval. These results support the proposed scheduler as a deadline-compatible approximation for repeated online engagement scheduling under operational uncertainty.

Zitieren

APA

Jeon, H., Choi, H. D., Choi, J., Kim, J., & Shin, N. (2026). Receding-Horizon Engagement Scheduling for Layered Air-Defense Under Operational Uncertainty. IEEE Access, 14, 125046-125061. https://doi.org/10.1109/access.2026.3722946

Vancouver

Jeon H, Choi HD, Choi J, Kim J, Shin N. Receding-Horizon Engagement Scheduling for Layered Air-Defense Under Operational Uncertainty. IEEE Access. 2026;14:125046-125061. doi:10.1109/access.2026.3722946

BibTeX
@article{Jeon2026,
  author = {Jeon, Ha-Min and Choi, Hyoung do and Choi, Jiwoo and Kim, Junseok and Shin, Nana},
  title = {Receding-Horizon Engagement Scheduling for Layered Air-Defense Under Operational Uncertainty},
  journal = {IEEE Access},
  year = {2026},
  volume = {14},
  pages = {125046--125061},
  doi = {10.1109/access.2026.3722946}
}
Kostenlos starten →