Metraipolis › archive › dc_b3fbbce7c15a
Retrieval Sequencing in a Compact Storage System with Side Access — arXiv:2610.40169
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.40169
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-01T02:47:44.917Z
- SHA-256 of the archived text
a21f1808518e1263cb5607d7f3b617c42568d2d7fb8f437e48dda9cb5fb8fc6e- Stable URL of this page
https://metraipolis.com/documento/dc_b3fbbce7c15a
How to cite
Retrieval Sequencing in a Compact Storage System with Side Access — arXiv:2610.40169 — arXiv (en), https://arxiv.org/abs/2610.40169 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_b3fbbce7c15a (Metraipolis archive dc_b3fbbce7c15a, sha256 a21f1808518e1263cb5607d7f3b617c42568d2d7fb8f437e48dda9cb5fb8fc6e)
BibTeX
@misc{dcb3fbbce7c15a,
title = {Retrieval Sequencing in a Compact Storage System with Side Access — arXiv:2610.40169},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.40169},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_b3fbbce7c15a; sha256 a21f1808518e1263cb5607d7f3b617c42568d2d7fb8f437e48dda9cb5fb8fc6e},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.40169. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In a compact storage system with side access, bins are arranged in adjacent vertical stacks. In each retrieval cycle, bins blocking access are lifted to create a temporary tunnel through which a robot extracts one requested bin from the side. The lifted bins are then lowered again, and the energy expenditure of the cycle equals the number of lifted bins. Given a pick list known in advance, we seek a retrieval order that minimizes total energy expenditure. For every number of stacks, we prove that the total energy separates into an instance constant and a pairwise penalty, and that every energy-optimal order is laminar within each stack. For two stacks, we prove that the retrieval sequencing problem is solvable in polynomial time. For three stacks, we give an exact polynomial-time reduction to a merge problem and characterize which merge-problem instances arise from the storage model. We define a recursive class of retrieval orders and construct a polynomial-time dynamic program that minimizes energy expenditure over this class. Finally, we quantify the additional energy savings from batching, which allows several requested bins to be retrieved in one cycle. Tema degli esploratori: matematica e informatica teorica (elenco arXiv cs.DS, nuovi lavori del giorno). Categorie arXiv: Data Structures and Algorithms (cs.DS) ; Computational Complexity (cs.CC). Pagina del lavoro: https://arxiv.org/abs/2610.40169 — 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:17:58.606Z dalla pagina https://arxiv.org/list/cs.DS/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).