AI Paper Atlas

Research map / Bandits and online learning / Online convex optimization and games

Robust Out-of-Order Retrieval for Grid-Based Storage at Maximum Capacity

Tzvika Geft, William Zhang, Jingjin Yu, Kostas Bekris

AAAI 2026 · Bandits and online learning › Online convex optimization and games · approach: Learning-augmented online algorithms

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
use robust storage (RobustS) with improved retrieval (ImpR) over BaseS+BaseRgrid storage-retrieval · square grids at full capacity, k = 0.25c to crelocations: up to 60-70% fewer for larger kImproved
add load-skipping enhancement to RobustS (ablation)RobustS · 15x15 and 19x19 gridssuccess rate of finding robust arrangement: 80%+ success beyond theoretical k limits of 6 and 8Improved
use RobustS storage in addition to ImpR retrieval (ablation)ImpR · k/c <= 0.5relocations to I/O row: eliminated for k/c <= 0.5Improved
greedy in-grid relocation of blockers (ImpR) instead of always using I/O row (ablation)retrieval · square gridsrelocations and I/O row usageImproved

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy