Research map / Learning theory and algorithms / Combinatorial and search optimization
Optimize Planning Heuristics to Rank, not to Estimate Cost-to-Goal
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Bounded Suboptimal Search with Learned Heuristics for Multi-Agent Systems (AAAI 2019 · similarity 0.89)
- Imitating Graph-Based Planning with Goal-Conditioned Policies (ICLR 2023 · similarity 0.86)
- Learning Heuristic Functions for HTN Planning (AAAI 2026 · similarity 0.86)
- Beyond Single-Step Updates: Reinforcement Learning of Heuristics with Limited-Horizon Search (AAAI 2026 · similarity 0.86)
- Narrowing the Gap Between Saturated and Optimal Cost Partitioning for Classical Planning (AAAI 2017 · similarity 0.86)
- Learning Domain-Independent Heuristics for Grounded and Lifted Planning (AAAI 2024 · similarity 0.85)
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.