2019 28th IEEE International Conference on Robot and Human Interactive Communication (RO-MAN) 2019
DOI: 10.1109/ro-man46459.2019.8956393
|View full text |Cite
|
Sign up to set email alerts
|

Deep-Pack: A Vision-Based 2D Online Bin Packing Algorithm with Deep Reinforcement Learning

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
10
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 20 publications
(10 citation statements)
references
References 21 publications
0
10
0
Order By: Relevance
“…The recent study on on-line BPPs by deep learning may start from [106], in which a CNN-based Q network is used to learn the position policy in 2D-BPPs. Verma et al claim a first trial to solve online 3D-BPPs with real-world physical constraints.…”
Section: On-line Bppsmentioning
confidence: 99%
See 1 more Smart Citation
“…The recent study on on-line BPPs by deep learning may start from [106], in which a CNN-based Q network is used to learn the position policy in 2D-BPPs. Verma et al claim a first trial to solve online 3D-BPPs with real-world physical constraints.…”
Section: On-line Bppsmentioning
confidence: 99%
“…The recent study on on‐line BPPs by deep learning may start from [106], in which a CNN‐based Q network is used to learn the position policy in 2D‐BPPs. Verma et al.…”
Section: Bin Packing Problemsmentioning
confidence: 99%
“…The previous studies successfully implemented online packing processes. Some have employed the fine-tuned heuristics based on the product packing routine [ 16 , 17 , 18 ] and the others have actively used deep reinforcement learning for their methods to learn how to pack things effectively themselves through trials and errors [ 11 , 19 , 20 , 21 ]. However, due to the high computational load of online optimization or learning complexity, objects have been assumed to be boxes without rotations or 3D problem has been decomposed into multiple 2D problems by packing objects layer by layer.…”
Section: Related Workmentioning
confidence: 99%
“…In addition, this task could be termed as 3D BPP depending on the dimensions being used for maximizing the space use [ 9 ]. Moreover, this task is an online BPP because the dimensions and orientations of objects are unknown before they are picked by the picker [ 10 , 11 ].…”
Section: Introductionmentioning
confidence: 99%
“…In view of the complexity of the combinatorial optimization problems, the DQN [24] combining the reinforcement learning function and the artificial neural network has demonstrated its strong performance, especially for the Maximum Cut [25], the Maximum Common Subgraph [26] and other combinatorial optimization problems. A deep reinforcement learning framework based on dual DQN has been proposed for an online two-dimensional packing study [27]. Although reinforcement learning has better performance than heuristic algorithms on the problem of combinatorial optimization, the performance is influenced by the amount of training data.…”
Section: B Previous Workmentioning
confidence: 99%