The Multi-AMR Buffer Storage, Retrieval, and Reshuffling Problem: Exact and Heuristic Approaches
Max Disselnmeyer, Thomas B\"omer, Laura D\"orr, Bastian Amberg, Anne Meyer

TL;DR
This paper addresses the complex Multi-AMR Buffer Storage, Retrieval, and Reshuffling Problem in dense manufacturing, proposing an exact binary integer programming model and a hierarchical heuristic for efficient multi-robot management.
Contribution
It introduces a novel adaptive approach for managing concurrent storage and retrieval tasks with robot fleets, including an exact model and a scalable heuristic solution.
Findings
Exact binary integer programming model for benchmarking
Hierarchical heuristic significantly reduces computation time
Heuristic proves viable for real-time control in high-density environments
Abstract
Buffer zones are essential in production systems to decouple sequential processes. In dense floor storage environments, such as space-constrained brownfield facilities, manual operation is increasingly challenged by severe labor shortages and rising operational costs. Automating these zones requires solving the Buffer Storage, Retrieval, and Reshuffling Problem (BSRRP). While previous work has addressed scenarios where the focus is limited to reshuffling and retrieving a fixed set of items, real-world manufacturing necessitates an adaptive approach that also incorporates arriving unit loads. This paper introduces the Multi-AMR BSRRP, coordinating a robot fleet to manage concurrent reshuffling, alongside time-windowed storage and retrieval tasks, within a shared floor area. We formulate a Binary Integer Programming (IP) model to obtain exact solutions for benchmarking purposes. As the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
