Multi-Objective Reinforcement Learning for Large-Scale Tote Allocation in Human-Robot Collaborative Fulfillment Centers
Not on the map. Why?
Abstract (arXiv)
Optimizing the consolidation process in container-based fulfillment centers requires trading off competing objectives such as processing speed, resource usage, and space utilization while adhering to a range of real-world operational constraints. This process involves moving items between containers via a combination of human and robotic workstations to free up space for inbound inventory and increase container utilization. We formulate this problem as a large-scale Multi-Objective Reinforcement Learning (MORL) task with high-dimensional state spaces and dynamic system behavior. Our method builds on recent theoretical advances in solving constrained RL problems via best-response and no-regret dynamics in zero-sum games, enabling principled minimax policy learning. Policy evaluation on realistic warehouse simulations shows that our approach effectively trades off objectives, and we empirically observe that it learns a single policy that simultaneously satisfies all constraints, even if this is not theoretically guaranteed. We further introduce a theoretical framework to handle the problem of error cancellation, where time-averaged solutions display oscillatory behavior. This method returns a single iterate whose Lagrangian value is close to the minimax value of the game. These results demonstrate the promise of MORL in solving complex, high-impact decision-making problems in large-scale industrial systems.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 15 of its 23 references that are in the map. First posted on arXiv 27 Feb 2026.
Builds on
15 of 23 references.
References · 15
- 2017Proximal Policy Optimization Algorithmscited by 14,441
- 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,635
- 2013Playing Atari with Deep Reinforcement Learningcited by 3,211
- 2018Reward Constrained Policy Optimizationcited by 397
- 2017Preventing Fairness Gerrymandering: Auditing and Learning for Subgroup Fairnesscited by 381
- 2021A Practical Guide to Multi-Objective Reinforcement Learning and Planningcited by 240
- 2019A Generalized Algorithm for Multi-Objective Reinforcement Learning and Policy Adaptationcited by 166
- 2019Constrained Reinforcement Learning Has Zero Duality Gapcited by 144
- 2021Reward is enough for convex MDPscited by 82
- 2019Reinforcement Learning with Convex Constraintscited by 57
- 2021State Augmented Constrained Reinforcement Learning: Overcoming the Limitations of Learning with Rewardscited by 37
- 2024The Max-Min Formulation of Multi-Objective Reinforcement Learning: From Theory to a Model-Free Algorithmcited by 13
Built on by
Not cited yet.