Leveraging buffer and lookahead information for online 3D bin packing via deep reinforcement learning
Year: 2026
Type: article
Abstract: The 3D Bin Packing Problem (3D-BPP) is critical for optimizing automated logistics, where marginal improvements in space utilization yield significant benefits. However, existing methods often feature overly complex architectures and underutilize buffer and lookahead information. This paper proposes a novel Deep Reinforcement Learning framework to address these limitations. Our streamlined architecture utilizes a dual-stream Transformer backbone, comprising an Item Stream with Lookahead Cross-Attention and a Space Stream with Geometry Cross-Attention. This is coupled with a dynamic HyperBiaffine decoder driven by a Hypernetwork, enabling the system to autonomously recalibrate packing strategies based on real-time spatial clutter and anticipated future cargo. Extensive evaluations on the RS, CUT-1, and CUT-2 datasets demonstrate superior performance. In the baseline configuration (Buffer = 1, Lookahead = 0), our model achieves 87.3% space utilization, outperforming the state-of-the-art Packing Configuration Tree method’s 86.0%. When maximizing buffer and lookahead capacities to 5, utilization peaks at 94.4% compared to PCT’s 93.3%. Ultimately, these results firmly validate the high efficiency and superior performance of our proposed method.
Source: Frontiers in Robotics and AI
Authors: Tran Van Thien, Ngoc-Tam BUI, Hiroshi Hasegawa
Institution: Shibaura Institute of Technology
Language: English
Subfield: Industrial and Manufacturing Engineering
Field: Engineering
Domain: Physical Sciences
Open Access status: gold
Estimated APC paid: $2,353
OpenAlex ID: W7235860058
