Metraipolis › archive › dc_d8dc09a28360
Limit Theorems and Optimal Policies for Flock Flight through Poisson Forests — arXiv:2610.39378
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.39378
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-01T02:35:40.952Z
- SHA-256 of the archived text
ac0a89ea6357ed118ed74ffaf779249532b6db33253ccc09b63fef2741df0e53- Stable URL of this page
https://metraipolis.com/documento/dc_d8dc09a28360
How to cite
Limit Theorems and Optimal Policies for Flock Flight through Poisson Forests — arXiv:2610.39378 — arXiv (en), https://arxiv.org/abs/2610.39378 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d8dc09a28360 (Metraipolis archive dc_d8dc09a28360, sha256 ac0a89ea6357ed118ed74ffaf779249532b6db33253ccc09b63fef2741df0e53)
BibTeX
@misc{dcd8dc09a28360,
title = {Limit Theorems and Optimal Policies for Flock Flight through Poisson Forests — arXiv:2610.39378},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.39378},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d8dc09a28360; sha256 ac0a89ea6357ed118ed74ffaf779249532b6db33253ccc09b63fef2741df0e53},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.39378. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Inspired by birds flying through cluttered environments, Karaman and Frazzoli showed that high-speed flight through an ergodic random forest exhibits an ultimate speed limit: above a critical speed, almost surely no infinite collision-free trajectory exists for a single bird. This paper formulates a corresponding bulk-transport problem for many birds. We construct an explicit directed corridor network in a Poisson disk forest and impose a common temporal headway at its waypoints. The maximum current equals a minimum vertex-cut capacity and is achieved by repeated flight along vertex-disjoint paths. The same schedule maximizes completed traversals at every finite horizon, with constant forward speed and no internal waiting. For a forest belt of fixed depth, exact transverse superadditivity yields an almost-sure deterministic current-density limit. A uniform shape theorem for an asymmetric planar dual identifies the current when depth and width grow together. For diverging depth bounded by a constant times width, this current equals the width-first, depth-second limit and is independent of the positive aspect ratio. When diagonal corridors are available, bulk current is positive at sufficiently low obstacle intensity and zero at sufficiently high intensity. For stochastic demand, an upstream admission queue is stable at every rate below the finite-network capacity. Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.PR, nuovi lavori del giorno). Categorie arXiv: Systems and Control (eess.SY) ; Robotics (cs.RO); Probability (math.PR). Pagina del lavoro: https://arxiv.org/abs/2610.39378 — 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-11-01T02:14:58.669Z dalla pagina https://arxiv.org/list/math.PR/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).