Research map / Reinforcement learning / MDPs and planning
Online Planning with Lookahead Policies
Yonathan Efroni, Mohammad Ghavamzadeh, Shie Mannor
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 |
|---|---|---|---|
| Increase the lookahead horizon h | h-RTDP · Exact finite-horizon MDP | sample complexity: 1/h | Improved |
| Increase the lookahead horizon h | h-RTDP · Exact finite-horizon MDP | computation cost | Hurt |
| Use an approximate state abstraction with reduced state space S_\phi | h-RTDP · Approximate state abstraction | space complexity | Improved |
Closest papers by meaning
- Confident Approximate Policy Iteration for Efficient Local Planning in $q^\pi$-realizable MDPs (NeurIPS 2022 · similarity 0.88)
- Adaptive Online Packing-guided Search for POMDPs (NeurIPS 2021 · similarity 0.86)
- Online Robust Planning Under Model Uncertainty: A Sample-Based Approach (AAAI 2026 · similarity 0.86)
- Graph Sparse Sampling: Breaking the Curse of the Horizon in Continuous MDP Planning (NeurIPS 2026 · similarity 0.84)
- Discovering Options That Minimize Average Planning Time (AAAI 2025 · similarity 0.84)
- Reinforcement Learning with Multi-Step Lookahead Information Via Adaptive Batching (NeurIPS 2026 · similarity 0.84)
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.
