Metraipolis › archive › dc_ccefb69324d8
Fixed-Haven Reservation for Online Multi-Agent Pickup and Delivery in Dense Warehouses — arXiv:2608.26759
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.26759
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-17T13:16:36.910Z
- SHA-256 of the archived text
a454a4f6b549d651a78f19f42a3f0cc534b3eff50628bf4197213286c64dee37- Stable URL of this page
https://metraipolis.com/documento/dc_ccefb69324d8
How to cite
Fixed-Haven Reservation for Online Multi-Agent Pickup and Delivery in Dense Warehouses — arXiv:2608.26759 — arXiv (en), https://arxiv.org/abs/2608.26759 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ccefb69324d8 (Metraipolis archive dc_ccefb69324d8, sha256 a454a4f6b549d651a78f19f42a3f0cc534b3eff50628bf4197213286c64dee37)
BibTeX
@misc{dcccefb69324d8,
title = {Fixed-Haven Reservation for Online Multi-Agent Pickup and Delivery in Dense Warehouses — arXiv:2608.26759},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.26759},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ccefb69324d8; sha256 a454a4f6b549d651a78f19f42a3f0cc534b3eff50628bf4197213286c64dee37},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.26759. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Dense warehouses often contain single-lane aisles, dead ends, and tree-like guidepaths that leave little room for idle agents to wait without blocking others. Existing Multi-Agent Pickup and Delivery (MAPD) guarantees for completing all finitely released tasks typically rely on extra waiting endpoints that planned paths can avoid, or on biconnected topology; these assumptions may fail in such layouts. We study fixed-Haven reservation for online MAPD, where pickup-delivery tasks are released over time. Each agent owns a fixed Safe Haven (Haven for short), usually its start cell, that only the owner may occupy and that other agents treat as blocked. For finite task releases, we prove that this fixed-Haven contract completes all released tasks under Haven-Reachability and explicit planning/progress assumptions. We implement the contract in SHARP, a Safe-Haven Retreat Planner that keeps every busy or retreating agent on a collision-free reserved route ending at its Haven. We compare SHARP with representative TP and PIBT-family MAPD baselines: Token Passing (TP), Priority Inheritance with Backtracking (PIBT), and PIBT with Temporary Priority and Temporary Avoidance (PIBTTP-TA) for biconnected main areas with attached trees. In the robustness sweep, SHARP is the only method with 100% success on all tested configurations, at substantially higher centralized planning cost on tree-like layouts. A TP-style fixed-home-return counterfactual with full-route validation also recovers robustness on tested tree-like layouts, suggesting that fixed return is a central robustness mechanism there. A no-overwrite variant shows that disabling mid-retreat reassignment worsens service time (release-to-delivery latency) by 1.89 times and makespan by 1.53 times in the tested high-load tree condition. 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.26759 — 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.992Z 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).