On the problem of assigning multiple interceptors over multiple aerial threats

Abstract

This article investigates the problem of assigning multiple identical interceptors over multiple identical aerial threats, where all interceptors are launched in a single salvo. For this problem, two strategies have been studied in the literature: (A) to spread all interceptors as evenly as possible over all threats, and (B) to randomly assign all interceptors over the threats. The main contributions of this article are as follows. First, the literature contains empirical evidence that Strategy A is more efficient than Strategy B in terms of the mean number of missed threats, when the number of interceptors is no less than the number of threats. This article gives a rigorous proof of this fact. Secondly, it demonstrates numerically that Strategy~A can be significantly more efficient than Strategy B. Thirdly, it shows that Strategy~A is not only superior to Strategy B, but also the bona fide optimal strategy. Finally, this article establishes that these conclusions also hold when the number of interceptors is less than the number of threats.

Faber-Walsh field expansions for the planar conductivity problem with multiple inclusions
Doosung Choi, Mikyoung Lim
arXiv24 Sep 2026PreprintarXiv licenceFull textAnalysis & PDEsarXiv
An exact algorithm for the pickup and delivery problem with time windows and requests split across multiple stacks
Ali Mehsin Alyasiry, Michael Forbes, Ella Wang
arXiv6 Oct 2026PreprintarXiv licenceFull textOptimisation & controlarXiv
Numerical Study of Reported Multiple Solutions to a Cauchy Problem for the 2d Incompressible Euler Equations
Allen Tesdall, Richard Sanders
arXiv10 Sep 2026PreprintarXiv licenceFull textAnalysis & PDEs Numerical analysis & scientific computingarXiv
Addressing threats to validity in large dataset research
Wonsuk Yoo, John P A Ioannidis
PLOS Medicine1 Nov 2026Peer-reviewedCC BYFull textStatistics Epidemiology & public healthPLOSEurope PMCEurope PMCPMC
The Road to Liberation is Paved with Threats: A Biopsychosocial Perspective on Minoritized Individuals’ Responses to Hierarchy-Disruptive Social Change
Marty Colombo, Daan Scheepers, Félice van Nunspeet
PsyArXiv22 Oct 2026PreprintCC BY 4.0Full textStatistics PhysiologyOSF

Cite

BibTeX RIS

BibTeX

@misc{hong2026problem,
  title = {{On the problem of assigning multiple interceptors over multiple aerial threats}},
  author = {Liang Hong},
  howpublished = {arXiv},
  year = {2026},
  month = aug,
  doi = {10.48550/arxiv.2608.31143},
  eprint = {2608.31143},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2608.31143},
  note = {CC BY 4.0},
}

RIS

TY  - UNPB
TI  - On the problem of assigning multiple interceptors over multiple aerial threats
AU  - Liang Hong
PY  - 2026
DA  - 2026/08/31
PB  - arXiv
DO  - 10.48550/arxiv.2608.31143
UR  - https://arxiv.org/abs/2608.31143
AB  - This article investigates the problem of assigning multiple identical interceptors over multiple identical aerial threats, where all interceptors are launched in a single salvo. For this problem, two strategies have been studied in the literature: (A) to spread all interceptors as evenly as possible over all threats, and (B) to randomly assign all interceptors over the threats. The main contributions of this article are as follows. First, the literature contains empirical evidence that Strategy A is more efficient than Strategy B in terms of the mean number of missed threats, when the number of interceptors is no less than the number of threats. This article gives a rigorous proof of this fact. Secondly, it demonstrates numerically that Strategy~A can be significantly more efficient than Strategy B. Thirdly, it shows that Strategy~A is not only superior to Strategy B, but also the bona fide optimal strategy. Finally, this article establishes that these conclusions also hold when the number of interceptors is less than the number of threats.
ER  -

Abstract

Related

Cite