miscellaneous-3
3D Bin Packing
3260 papers • 126 benchmarks • 313 datasets
As a classic NP-hard problem, the bin packing problem (1D-BPP) seeks for an assignment of a collection of items with various weights to bins. The optimal assignment houses all the items with the fewest bins such that the total weight of items in a bin is below the bin’s capacity. In its 3D version (3D-BPP), an item has a 3D “weight” corresponding to its length, width and height.
(Image credit: Papersgraph)
Benchmarks
These leaderboards are used to track progress in 3d-bin-packing-3
Trend
Dataset
Best Model
Actions
No benchmarks available.
Libraries
iUse these libraries to find 3d-bin-packing-3 models and implementations
Datasets
No datasets available.
Subtasks
No subtasks available.
Most implemented papers
Learning practically feasible policies for online 3D bin packing
Hang Zhao, Kai Xu, Chenyang Zhu, Xin Xu, Hui Huang•Mon Aug 30 2021
A reward function is introduced that dictates the robot to place items in a far-to-near order and therefore simplifies the collision avoidance in movement planning of the robotic arm and outperforms the state-of-the-art methods significantly and is practically usable for real-world applications.
104