English

Preference-Conditioned Reinforcement Learning for Space-Time Efficient Online 3D Bin Packing

Robotics 2026-03-10 v1

Abstract

Robotic bin packing is widely deployed in warehouse automation, with current systems achieving robust performance through heuristic and learning-based strategies. These systems must balance compact placement with rapid execution, where selecting alternative items or reorienting them can improve space utilization but introduce additional time. We propose a selection-based formulation that explicitly reasons over this trade-off: at each step, the robot evaluates multiple candidate actions, weighing expected packing benefit against estimated operational time. This enables time-aware strategies that selectively accept increased operational time when it yields meaningful spatial improvements. Our method, STEP (Space-Time Efficient Packing), uses a preference-conditioned, Transformer-based reinforcement learning policy, and allows generalization across candidate set sizes and integration with standard placement modules. It achieves a 44% reduction in operational time without compromising packing density. Additional material is available at https://step-packing.github.io.

Keywords

Cite

@article{arxiv.2603.07800,
  title  = {Preference-Conditioned Reinforcement Learning for Space-Time Efficient Online 3D Bin Packing},
  author = {Nikita Sarawgi and Omey M. Manyar and Fan Wang and Thinh H. Nguyen and Daniel Seita and Satyandra K. Gupta},
  journal= {arXiv preprint arXiv:2603.07800},
  year   = {2026}
}

Comments

8 pages, 5 figures. Accepted to IEEE International Conference on Robotics and Automation 2026. Project Website: https://step-packing.github.io

R2 v1 2026-07-01T11:09:24.980Z