Strengthening landmark heuristics via hitting sets

DOI10.3233/978-1-60750-606-5-329zbMATH Open1211.90297OpenAlexW1501886372MaRDI QIDQ2999151FDOQ2999151

Malte Helmert, Blai Bonet

Publication date: 11 May 2011

Full work available at URL: http://gki.informatik.uni-freiburg.de/papers/bonet-helmert-ecai2010.pdf

Recommendations

• Sound and complete landmarks for and/Or graphs
• Improving delete relaxation heuristics through explicitly represented conjunctions
• Landmark-enhanced abstraction heuristics
• Combining the Delete Relaxation with Critical-Path Heuristics: A Direct Characterization
• Cost optimal planning with multi-valued landmarks

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Abstract computational complexity for mathematical programming problems (90C60)

Cited In (3)

• Width-based search for multi agent privacy-preserving planning
• Landmark-enhanced abstraction heuristics
• The LM-Cut Heuristic Family for Optimal Numeric Planning with Simple Conditions

This page was built for publication: Strengthening landmark heuristics via hitting sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2999151)