paper-with-me

홈 › Papers

Curriculum RL meets Monte Carlo Planning: Optimization of a Real World Container Management Problem

2025-03-21 · Abhijeet Pendyala, Tobias Glasmachers

In this work, we augment reinforcement learning with an inference-time collision model to ensure safe and efficient container management in a waste-sorting facility with limited processing capacity. Each container has two optimal emptying volumes that trade off higher throughput against overflow risk. Conventional reinforcement learning (RL) approaches struggle under delayed rewards, sparse critical events, and high-dimensional uncertainty -- failing to consistently balance higher-volume empties with the risk of safety-limit violations. To address these challenges, we propose a hybrid method comprising: (1) a curriculum-learning pipeline that incrementally trains a PPO agent to handle delayed rewards and class imbalance, and (2) an offline pairwise collision model used at inference time to proactively avert collisions with minimal online cost. Experimental results show that our targeted inference-time collision checks significantly improve collision avoidance, reduce safety-limit violations, maintain high throughput, and scale effectively across varying container-to-PU ratios. These findings offer actionable guidelines for designing safe and efficient container-management systems in real-world facilities.

📄 PDF Abstract BibTeX arXiv:2503.17194

Code (1)

https://gitlab.com/anonymousppocl_cm1/anonymous_collisions_paper 공식 구현

Tasks

Collision AvoidanceManagementreinforcement-learningReinforcement LearningReinforcement Learning (RL)

Methods 이 논문이 사용한 방법론

Entropy Regularization 설명 없음
PPO Proximal Policy Optimization, or PPO, is a policy gradient method for reinforcement learning. The motivation was to have an algorithm with the data efficiency and reliable…

Similar Papers 제목 키워드 기반

Monte-Carlo Planning: Theoretically Fast Convergence Meets Practical Efficiency

2013-09-26 · Zohar Feldman, Carmel Domshlak

Popular Monte-Carlo tree search (MCTS) algorithms for online planning, such as epsilon-greedy tree search and UCT, aim at rapidly identifying a reasonably good action, but provide rather poor worst-case guarantees on per…

Compositional Monte Carlo Tree Diffusion for Extendable Planning

2025-10-24 · Jaesik Yoon, Hyeonseo Cho, Sungjin Ahn arxiv

Monte Carlo Tree Diffusion (MCTD) integrates diffusion models with structured tree search to enable effective trajectory exploration through stepwise reasoning. However, MCTD remains fundamentally limited by training tra…

Probabilistic Planning with Sequential Monte Carlo methods

2019-05-01 · ICLR 2019 5 · Alexandre Piche, Valentin Thomas, Cyril Ibrahim, Yoshua Bengio 외

In this work, we propose a novel formulation of planning which views it as a probabilistic inference problem over future optimal trajectories. This enables us to use sampling methods, and thus, tackle planning in continu…

continuous-controlContinuous Control

POLY-HOOT: Monte-Carlo Planning in Continuous Space MDPs with Non-Asymptotic Analysis

2020-06-08 · NeurIPS 2020 12 · Weichao Mao, Kaiqing Zhang, Qiaomin Xie, Tamer Başar

Monte-Carlo planning, as exemplified by Monte-Carlo Tree Search (MCTS), has demonstrated remarkable performance in applications with finite spaces. In this paper, we consider Monte-Carlo planning in an environment with c…

Monte-Carlo Planning in Large POMDPs

2010-12-01 · NeurIPS 2010 12 · David Silver, Joel Veness

This paper introduces a Monte-Carlo algorithm for online planning in large POMDPs. The algorithm combines a Monte-Carlo update of the agent's belief state with a Monte-Carlo tree search from the current belief state. The…