PackLab: A Comprehensive Framework for Developing, Training, and Evaluating MLLMs in Robotic Bin Packing
Donghao Zhou, Jia-Hui Pan, Fan Zhang, Xingyuan Bu, Shilong Li, Xiaojie Gao, Yun-Hui Liu, Chi-Wing Fu and 1 others
The Chinese University of Hong Kong · M-A-P
Published September 20, 2026 · on the feed September 24, 2026 · ▲ 11 · arXiv 2609.23784
The abstract
Robotic bin packing requires long-horizon sequential decision-making, as each object placement affects the available space for subsequent packing. Existing methods primarily rely on hand-crafted geometric heuristics that optimize predefined objectives or reinforcement learning policies learned through trial and error over predefined training configurations. Despite recent advances in multimodal large language models (MLLMs) for this task, their potential for closed-loop sequential decisions across heterogeneous packing configurations remains underexplored. To address this gap, we introduce PackLab, a comprehensive framework for developing, training, and evaluating MLLMs for closed-loop robotic bin packing. PackLab-Suite provides a physics-based simulation platform for scalable generation of diverse training packing trajectories and evaluation of their physical outcomes. PackLab-VLM is a packing-specialized MLLM that understands the evolving object and container states to jointly select objects and predict placements in a closed-loop manner. PackLab-Bench provides standardized packing scenarios at multiple difficulty levels for systematic evaluation. Extensive experiments demonstrate that, on average, PackLab-VLM outperforms conventional packing heuristics, traditional reinforcement learning methods, and general-purpose MLLMs across object sets and container configurations, highlighting the potential of MLLMs for long-horizon robotic packing. The code, model, dataset, and benchmark are available at https://github.com/Correr-Zhou/PackLab .
The Brief
2:33A short podcast summary of the paper. Written and voiced by AI.
Transcript
PackLab. A Comprehensive Framework for Developing, Training, and Evaluating MLLMs in Robotic Bin Packing. By Donghao Zhou and eight others, from the Chinese University of Hong Kong and M-A-P. Published on the twentieth of September. Its code repository is worked out: about sixty source files, with a readme.
Robotic bin packing is a long-horizon problem of sequential decisions, because every object placed changes the space left for everything after it. Existing methods mostly rely on hand-crafted geometric heuristics that optimize predefined objectives, or on reinforcement learning policies learned by trial and error over predefined training configurations. Multimodal large language models have recently been applied to the task, but their potential for closed- loop sequential decisions across heterogeneous packing configurations remains underexplored. Closed-loop is the key phrase. A closed-loop packer looks again after every placement and decides the next move from what it now sees, rather than committing to a whole plan up front.
PackLab is a framework meant to cover the whole cycle for these models: developing them, training them, and evaluating them on closed-loop robotic bin packing. It comes in three parts, and each part does one of those jobs.
PackLab-Suite is a physics-based simulation platform. It generates diverse packing trajectories for training at scale, and it evaluates their physical outcomes. PackLab-VLM is a multimodal model specialized for packing. It understands how the objects and the container evolve, and in a closed loop it jointly selects which object to pack next and predicts where to place it. PackLab-Bench supplies standardized packing scenarios at multiple difficulty levels, so that evaluation is systematic. Put together, the three pieces form a loop of their own. The suite produces the data, the model learns from it, and the benchmark checks the result at graded levels of difficulty.
In extensive experiments, PackLab-VLM on average outperforms three kinds of competitor: conventional packing heuristics, traditional reinforcement learning methods, and general-purpose multimodal models. The comparison spans different object sets and different container configurations. The code, the model, the dataset and the benchmark are all released.
On the authors' reading, the result shows the potential of multimodal models for long-horizon robotic packing. The framework's part in that is to make the claim testable in one place. Data is generated, a model is trained, and outcomes are scored in the same physics, so a model that chooses each object and each placement with the evolving scene in view can be set directly against methods built on fixed heuristics or fixed training configurations.
Paper Quest · 7 chapters · about 41 min
Play this paper
Learn it by doing: make the calls the authors made, guess the result before you see it, and defend it in a viva graded on your own words. Chapter 1 is right here.
Chapter 1 🧩 · The problem
Every object you drop in a box steals space from the next. That is where this quest begins.
You are programming a robot arm to fill a box with objects of many sizes. Every object you place changes the space left for all the ones after it.
The road ahead
- 1 · The problem ~7 min Packing a box is a chain of decisions, and today's tools either judge each placement alone or only know the setups they trained on.
- 2 · What came before ~3 min
- 3 · The key idea ~9 min One multimodal model picks the next object and its spot, looks again after every placement, and learns from simulated packing runs.
- 4 · Choose your own research ~3 min
- 5 · Build the method ~8 min Simulate many packing runs, fine-tune a multimodal model on them, let it choose object and spot step by step, then test it on graded scenarios.
- 6 · The experiment ~6 min You’ll guess: Averaged across object sets and containers, how did PackLab-VLM fare against conventional packing heuristics, traditional reinforcement learning, and general-purpose multimodal models?
- 7 · The viva ~5 min Three questions from the examiners, answered in your own words. Win it for the paper’s trophy.
Free, with Google or an email address. Your stars and progress are kept.