Research map / Learning theory and algorithms / Combinatorial and search optimization
Incorporating Domain-Independent Planning Heuristics in Hierarchical Planning
Vikas Shivashankar, Ron Alford, David Aha
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 |
|---|---|---|---|
| add LMCut heuristic guidance to hierarchical (HGN) search instead of blind search (ablation) | HOGL · Logistics/Blocks-World/Depots total | problems solved: 405 -> 537 | Improved |
| add hierarchical knowledge (HGN methods) to LMCut A* search | A*-LMCut · Logistics/Blocks-World/Depots total | problems solved: 241 -> 537 | Improved |
| use LMCut-based heuristic instead of landmark hL heuristic | HGN planner (HOGL vs HOpGDP) · Logistics/Blocks-World/Depots total | problems solved: 504 -> 537 | Improved |
| use LMCut-based heuristic instead of landmark hL heuristic | HGN planner (HOGL vs HOpGDP) · pairwise commonly solved problems | node expansions: fewer expansions on 407 problems vs 20 | Improved |
| add heuristic guidance to hierarchical search in Blocks-World, where methods are strong (ablation) | HOGL · Blocks-World | problems solved: 208 -> 219 | Improved |
Closest papers by meaning
- Learning Domain-Independent Heuristics for Grounded and Lifted Planning (AAAI 2024 · similarity 0.89)
- SayCanPay: Heuristic Planning with Large Language Models Using Learnable Domain Knowledge (AAAI 2024 · similarity 0.88)
- Learning Hierarchical Task Knowledge for Planning (AAAI 2025 · similarity 0.87)
- PathWise: Planning through World Model for Automated Heuristic Design via Self-Evolving LLMs (ICML 2026 · similarity 0.87)
- On the Computational Complexity of Plan Verification, (Bounded) Plan-Optimality Verification, and Bounded Plan Existence (AAAI 2024 · similarity 0.86)
- Learning Planning Domains from Non-redundant Fully-Observed Traces: Theoretical Foundations and Complexity Analysis (AAAI 2024 · 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.
