Metraipolis › archive › dc_94fee215aa32
Dynamic Haven Selection for Multi-Agent Pickup and Delivery in Constrained Warehouses — arXiv:2608.26939
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.26939
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-17T13:16:36.932Z
- SHA-256 of the archived text
31ae36f45b38d283c47013117d6685cb0b33109dfcabfeb53d8da2b4c1d9db62- Stable URL of this page
https://metraipolis.com/documento/dc_94fee215aa32
How to cite
Dynamic Haven Selection for Multi-Agent Pickup and Delivery in Constrained Warehouses — arXiv:2608.26939 — arXiv (en), https://arxiv.org/abs/2608.26939 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_94fee215aa32 (Metraipolis archive dc_94fee215aa32, sha256 31ae36f45b38d283c47013117d6685cb0b33109dfcabfeb53d8da2b4c1d9db62)
BibTeX
@misc{dc94fee215aa32,
title = {Dynamic Haven Selection for Multi-Agent Pickup and Delivery in Constrained Warehouses — arXiv:2608.26939},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.26939},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_94fee215aa32; sha256 31ae36f45b38d283c47013117d6685cb0b33109dfcabfeb53d8da2b4c1d9db62},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.26939. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Space-efficient warehouse layouts often contain single-agent-width aisles and dead-end workstations where robots have few places to wait without blocking others. In Multi-Agent Pickup and Delivery (MAPD) on such constrained layouts, robots must accept online pickup-delivery tasks while preserving protected waiting locations called Havens. The Safe HAven Retreat Planner (SHARP) introduced a mechanism that extends each committed task path with a validated retreat to the agent's dedicated initial Haven, but fixed-Haven commitments can send agents toward distant Havens after deliveries. We present A-sharp (Adaptive SHARP), which changes an agent's retreat target at task assignment time. A naive switch can cause two agents to rely on the same waiting location or let another committed path pass through a location that is still occupied or reserved. A-sharp prevents these failures with an availability test for candidate Havens and a pending-release rule that keeps the previous Haven protected until the agent departs. Under explicit Haven-structure and Safe Interval Path Planning (SIPP) assumptions, we prove invariant preservation and finite-release completeness: every task in any finite release sequence is delivered in finite time. Across 72,000 runs on 14,400 paired map-agent-count-rate-seed cases over four maps, both SHARP and A-sharp complete their respective 14,400 runs. For makespan (final delivery time), a prespecified paired comparison with Holm correction over all 138 configurations with more Havens than agents finds A-sharp significantly better in 107 configurations and never significantly worse than SHARP; on the tested tree map, the median reduction is 16.7%. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-08-28 in cs.MA). Categorie arXiv: Multiagent Systems (cs.MA) ; Robotics (cs.RO). Pagina del lavoro: https://arxiv.org/abs/2608.26939 — 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-17T13:16:16.993Z dalla pagina https://arxiv.org/catchup/cs.MA/2026-08-28?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).