2022 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) 2022
DOI: 10.1109/iros47612.2022.9982095
|View full text |Cite
|
Sign up to set email alerts
|

Online 3D Bin Packing Reinforcement Learning Solution with Buffer

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 10 publications
(9 citation statements)
references
References 8 publications
0
9
0
Order By: Relevance
“…A buffer can be employed to allow for multi-item action selection, and an agnostic data augmentation strategy paired with a model-based RL method can lead to results that outperform the state-of-the-art solutions in space utilization [100]. This model was based on the popular algorithm AlphaGo, which is a great adaptation for tackling the mixed palletizing problem without the need for heavy computational resources.…”
Section: Reinforcement Learningmentioning
confidence: 99%
“…A buffer can be employed to allow for multi-item action selection, and an agnostic data augmentation strategy paired with a model-based RL method can lead to results that outperform the state-of-the-art solutions in space utilization [100]. This model was based on the popular algorithm AlphaGo, which is a great adaptation for tackling the mixed palletizing problem without the need for heavy computational resources.…”
Section: Reinforcement Learningmentioning
confidence: 99%
“…Priority constraints also play a pivotal role in scenarios where specific items demand special handling due to factors like fragility, value, or time-sensitivity delivery. These constraints guide the packing strategy, ensuring that high-priority items are placed with care and precision [16,[21][22][23].…”
Section: Balancing Priority Fragility or Other Constraintsmentioning
confidence: 99%
“…Item rotation or orientation constraints play a crucial role in multidimensional binpacking problems, where items or boxes come in various shapes and sizes. These constraints pertain to how each box can be oriented or rotated within a container or bin; however, these can contribute to increased complexity [15,22,26,27]. Other constraints like dimension, weight, and volume are considered in most studies to address the unique requirements of different scenarios.…”
Section: Balancing Priority Fragility or Other Constraintsmentioning
confidence: 99%
See 1 more Smart Citation
“…Recently, Zhao et al generated a dataset with 64 instances addressing this issue [20,21]. A large body of research uses the guillotine cut method to generate the problem instances [22][23][24]. Since, in this method, the optimal solution for each problem instance is known, these datasets are widely used to test the packing efficiency of online algorithms.…”
Section: Introductionmentioning
confidence: 99%