Research map / Learning theory and algorithms / Combinatorial and search optimization
Monte-Carlo Tree Search for Constrained POMDPs
Jongmin Lee, Geon-hyeong Kim, Pascal Poupart, Kee-Eung Kim
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use CC-POMCP (lambda-optimized scalarized tree search) instead of cost-pruning baseline MCTS | POMCP / CPOMDP solver · Rocksample (7,8) | cumulative reward: -0.23 -> 9.36 | Improved |
| use CC-POMCP instead of cost-pruning baseline MCTS | POMCP / CPOMDP solver · Rocksample (11,11) | cumulative reward: 0.14 -> 2.65 | Improved |
| use CC-POMCP instead of cost-pruning baseline MCTS | POMCP / CPOMDP solver · Constrained Pong, cost threshold 50 | cumulative reward: -20.45 -> 17.88 | Improved |
| use online CC-POMCP instead of offline CALP | POMCP / CPOMDP solver · Rocksample (7,8) | cumulative reward: 3.67 -> 9.36 | Improved |
| use online CC-POMCP instead of offline CALP | POMCP / CPOMDP solver · Rocksample (5,7) | cumulative reward: 12.77 -> 11.36 | No clear effect |
| tighten cost threshold from 100 to 30 | POMCP / CPOMDP solver · Constrained Pong | cumulative reward: 19.27 -> -0.07 | Hurt |
Closest papers by meaning
- Threshold UCT: Cost-Constrained Monte Carlo Tree Search with Pareto Curves (AAAI 2025 · similarity 0.92)
- Power Mean Estimation in Stochastic Continuous Monte-Carlo Tree Search (ICML 2025 · similarity 0.87)
- Achieving $\tilde{O}(1/\epsilon)$ Sample Complexity for Constrained Markov Decision Process (NeurIPS 2024 · similarity 0.87)
- A Surprisingly Simple Continuous-Action POMDP Solver: Lazy Cross-Entropy Search Over Policy Trees (AAAI 2024 · similarity 0.87)
- Monte Carlo Tree Search in the Presence of Transition Uncertainty (AAAI 2024 · similarity 0.86)
- Graph-Based Stochastic-Power-UCT: Monte-Carlo Graph Search with Power Mean Estimation (NeurIPS 2026 · similarity 0.86)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
