Mitigating Dimensionality in 2D Rectangle Packing Problem under Reinforcement Learning Schema
Not on the map. Why?
Abstract (arXiv)
This paper explores the application of Reinforcement Learning (RL) to the two-dimensional rectangular packing problem. We propose a reduced representation of the state and action spaces that allow us for high granularity. Leveraging UNet architecture and Proximal Policy Optimization (PPO), we achieved a model that is comparable to the MaxRect heuristic. However, our approach has great potential to be generalized to nonrectangular packing problems and complex constraints.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 14 of its 48 references that are in the map. First posted on arXiv 15 Sep 2024.
Builds on
14 of 48 references.
References · 14
- 2015U-Net: Convolutional Networks for Biomedical Image Segmentationcited by 19,604
- 2019CE-Net: Context Encoder Network for 2D Medical Image Segmentationcited by 219
- 2021Deep Learning for Chest X-ray Analysis: A Surveycited by 84
- 2017On Pre-Trained Image Features and Synthetic Images for Deep Learningcited by 51
- 2020Online 3D Bin Packing with Constrained Deep Reinforcement Learningcited by 35
- 2019Continuous Dice Coefficient: a Method for Evaluating Probabilistic Segmentationscited by 25
- 2018Chest X-Ray Analysis of Tuberculosis by Deep Learning with Segmentation and Augmentationcited by 24
- 2021Learning Practically Feasible Policies for Online 3D Bin Packingcited by 16
- 2020Lung Segmentation from Chest X-rays using Variational Data Imputationcited by 15
- 2017Deep Convolutional Neural Networks as Generic Feature Extractorscited by 10
- 2022Online 3D Bin Packing Reinforcement Learning Solution with Buffercited by 8
- 2023MeROS: SysML-based Metamodel for ROS-based Systemscited by 6
Built on by
Not cited yet.