Planning Irregular Object Packing via Hierarchical Reinforcement Learning
Sichao Huang, Ziwei Wang, Jie Zhou, and Jiwen Lu

TL;DR
This paper introduces a hierarchical reinforcement learning method for packing irregular objects efficiently, optimizing sequence and placement to maximize packed items in realistic scenarios.
Contribution
It presents a novel deep hierarchical RL framework that plans packing sequences and placements for irregular objects, outperforming existing methods in simulation and real-world tests.
Findings
Packed more objects with less time than state-of-the-art methods.
Effective in both simulation and real-world robotic packing.
Hierarchical RL improves packing efficiency for irregular objects.
Abstract
Object packing by autonomous robots is an im-portant challenge in warehouses and logistics industry. Most conventional data-driven packing planning approaches focus on regular cuboid packing, which are usually heuristic and limit the practical use in realistic applications with everyday objects. In this paper, we propose a deep hierarchical reinforcement learning approach to simultaneously plan packing sequence and placement for irregular object packing. Specifically, the top manager network infers packing sequence from six principal view heightmaps of all objects, and then the bottom worker network receives heightmaps of the next object to predict the placement position and orientation. The two networks are trained hierarchically in a self-supervised Q-Learning framework, where the rewards are provided by the packing results based on the top height , object volume and placement…
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.
Taxonomy
TopicsAdvanced Manufacturing and Logistics Optimization · Optimization and Packing Problems
MethodsQ-Learning
