Optimizing 2D+1 Packing in Constrained Environments Using Deep Reinforcement Learning
This paper proposes a novel approach based on deep reinforcement learning (DRL) for the 2D+1 packing problem with spatial constraints. This problem is an extension of the traditional 2D packing problem, incorporating an additional constraint on the height dimension. Therefore, a simulator using the OpenAI Gym framework has been developed to efficiently simulate the packing of rectangular pieces onto two boards with height constraints. Furthermore, the simulator supports multidiscrete actions, enabling the selection of a position on either board and the type of piece to place. Finally, two DRL-based methods (Proximal Policy Optimization -- PPO and the Advantage Actor-Critic -- A2C) have been employed to learn a packing strategy and demonstrate its performance compared to a well-known heuristic baseline (MaxRect-BL). In the experiments carried out, the PPO-based approach proved to be a good solution for solving complex packaging problems and highlighted its potential to optimize resource utilization in various industrial applications, such as the manufacturing of aerospace composites.
Code (0)
등록된 구현이 없습니다.
Tasks
Deep Reinforcement LearningOpenAI GymMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Adjustable Robust Reinforcement Learning for Online 3D Bin Packing
Designing effective policies for the online 3D bin packing problem (3D-BPP) has been a long-standing challenge, primarily due to the unpredictable nature of incoming box sequences and stringent physical constraints. Whil…
3D Bin PackingDeep Reinforcement Learningreinforcement-learningReinforcement LearningAttention Actor-Critic algorithm for Multi-Agent Constrained Co-operative Reinforcement Learning
In this work, we consider the problem of computing optimal actions for Reinforcement Learning (RL) agents in a co-operative setting, where the objective is to optimize a common goal. However, in many real-life applicatio…
reinforcement-learningReinforcement Learning (RL)Deliberate Planning of 3D Bin Packing on Packing Configuration Trees
Online 3D Bin Packing Problem (3D-BPP) has widespread applications in industrial automation. Existing methods usually solve the problem with limited resolution of spatial discretization, and/or cannot deal with complex p…
3D Bin PackingDeep Reinforcement LearningOnline 3D Bin Packing with Constrained Deep Reinforcement Learning
We solve a challenging yet practically useful variant of 3D Bin Packing Problem (3D-BPP). In our problem, the agent has limited information about the items to be packed into the bin, and an item must be packed immediatel…
3D Bin PackingCollision AvoidanceDeep Reinforcement Learningreinforcement-learning+2Learning Practically Feasible Policies for Online 3D Bin Packing
We tackle the Online 3D Bin Packing Problem, a challenging yet practically useful variant of the classical Bin Packing Problem. In this problem, the items are delivered to the agent without informing the full sequence in…
3D Bin PackingCollision AvoidanceDeep Reinforcement Learning