AI Paper Atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

Incorporating Domain-Independent Planning Heuristics in Hierarchical Planning

Vikas Shivashankar, Ron Alford, David Aha

AAAI 2017 · Learning theory and algorithms › Combinatorial and search optimization · approach: Classical and HTN planning · 14 citations (OpenAlex)

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 changedWhereMeasuredEffect
add LMCut heuristic guidance to hierarchical (HGN) search instead of blind search (ablation)HOGL · Logistics/Blocks-World/Depots totalproblems solved: 405 -> 537Improved
add hierarchical knowledge (HGN methods) to LMCut A* searchA*-LMCut · Logistics/Blocks-World/Depots totalproblems solved: 241 -> 537Improved
use LMCut-based heuristic instead of landmark hL heuristicHGN planner (HOGL vs HOpGDP) · Logistics/Blocks-World/Depots totalproblems solved: 504 -> 537Improved
use LMCut-based heuristic instead of landmark hL heuristicHGN planner (HOGL vs HOpGDP) · pairwise commonly solved problemsnode expansions: fewer expansions on 407 problems vs 20Improved
add heuristic guidance to hierarchical search in Blocks-World, where methods are strong (ablation)HOGL · Blocks-Worldproblems solved: 208 -> 219Improved

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy