arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2603.26542cs.ROcs.AIcs.MAmath.OC
收藏

多AMR缓冲区存储、检索与重新排列问题:精确与启发式方法

The Multi-AMR Buffer Storage, Retrieval, and Reshuffling Problem: Exact and Heuristic Approaches

Karlsruhe Institute of Technology(卡尔斯鲁厄理工学院)

Max Disselnmeyer, Thomas Bömer, Laura Dörr, Bastian Amberg, Anne Meyer

AI总结:

本文提出多AMRBSRRP问题,通过二进制整数规划模型和分层启发式方法解决缓冲区存储、检索和重新排列问题,适用于高密度生产环境。

摘要:

缓冲区在生产系统中至关重要,用于解耦连续流程。在空间受限的brownfield设施中,手动操作面临劳动力短缺和运营成本上升的挑战。自动化这些区域需要解决缓冲区存储、检索和重新排列问题(BSRRP)。尽管先前工作关注固定物品的重新排列和检索,但现实制造需要适应性方法,包括到达的单元负载。本文引入多AMRBSRRP,协调机器人队伍在共享地板区域处理同时的重新排列、时间窗口存储和检索任务。我们建立了一个二进制整数规划(IP)模型以获得基准测试的精确解。由于问题NP难,使得精确方法在工业规模上计算不可行,我们提出了一种分层启发式方法。该方法将问题分解为A*搜索用于单元负载放置的任务级序列规划,以及约束编程(CP)方法用于多机器人协调和调度。实验显示与精确公式相比,计算时间减少了多个数量级。这些结果确认了启发式方法作为高密度生产环境响应控制逻辑的可行性。

英文摘要:

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 problem is NP-hard, rendering exact methods computationally intractable for industrial scales, we propose a hierarchical heuristic. This approach decomposes the problem into an A* search for task-level sequence planning of unit load placements, and a Constraint Programming (CP) approach for multi-robot coordination and scheduling. Experiments demonstrate orders-of-magnitude computation time reductions compared to the exact formulation. These results confirm the heuristic's viability as responsive control logic for high-density production environments.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑