Metraipolis › archive › dc_0a193b92011c
Feasibility Ceilings Before Learning: Sizing and Timing Bounds for Drone-Mesh Interception — arXiv:2610.20823
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.20823
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T08:43:53.088Z
- SHA-256 of the archived text
453651a61a8eaf60c046f636cccdbc28ebfc3ce8e515ebf2991823009194ccf6- Stable URL of this page
https://metraipolis.com/documento/dc_0a193b92011c
How to cite
Feasibility Ceilings Before Learning: Sizing and Timing Bounds for Drone-Mesh Interception — arXiv:2610.20823 — arXiv (en), https://arxiv.org/abs/2610.20823 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_0a193b92011c (Metraipolis archive dc_0a193b92011c, sha256 453651a61a8eaf60c046f636cccdbc28ebfc3ce8e515ebf2991823009194ccf6)
BibTeX
@misc{dc0a193b92011c,
title = {Feasibility Ceilings Before Learning: Sizing and Timing Bounds for Drone-Mesh Interception — arXiv:2610.20823},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.20823},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_0a193b92011c; sha256 453651a61a8eaf60c046f636cccdbc28ebfc3ce8e515ebf2991823009194ccf6},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.20823. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
A mesh of interceptors defending a fixed site must spread over the predicted arrival point of an approaching object. This is a recurring task in multi-agent robotics: N agents, each covering a disc of radius r, spread over a probability density so that a point drawn from it falls within some agent's disc. We give closed forms for the quantities that bound performance before any policy is chosen, and validate each by Monte Carlo. The uncertainty of a point predicted by extrapolating a noisy linear track follows from least-squares variance propagation plus a delta-method term for the uncertain arrival time, agreeing with simulation to within 1.8%. The coverage probability of a packed mesh admits a closed form accurate to 0.007 absolute, with a volumetric analogue. A naive area ratio misses a ceiling: while agents stay at least 2r apart, no mesh exceeds 90.69% coverage in the plane or 74.05% in a volume. This ceiling belongs to the separation constraint, not to the problem - permitting overlap substitutes Kershner's thinnest-covering density and removes it, the better regime above a crossover at p=0.80. Hexagonal packing is optimal among five arrangements; the centroidal-Voronoi configuration coverage control supplies reaches only half its coverage at small budgets. The Gaussian assumption is conservative under heavy tails and anisotropy but fragile under bias: a one-sigma aim-point offset costs 14 points of coverage. A repositioning team must also choose a commit time, and the admissible window can be empty. Against the applicable ceiling, analytic placement attains 85% of what the configuration permits while centralised PPO averages 15% over three trainer seeds, with a paired bootstrap against a null policy containing zero at every seed. We argue such ceilings should be computed before any learning experiment and quoted alongside every result. Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.MA, nuovi lavori del giorno). Categorie arXiv: Robotics (cs.RO) ; Machine Learning (cs.LG); Multiagent Systems (cs.MA). Pagina del lavoro: https://arxiv.org/abs/2610.20823 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-16T08:43:47.654Z dalla pagina https://arxiv.org/list/cs.MA/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).