Research map / Learning theory and algorithms / Combinatorial and search optimization
Homomorphisms of Lifted Planning Tasks: The Case for Delete-Free Relaxation Heuristics
Rostislav Horčík, Daniel Fišer, Álvaro Torralba
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 |
|---|---|---|---|
| Compute delete-relaxation heuristics on a reduced task obtained by mapping objects and grounding the mapped task | Lifted planning tasks · Hard-to-ground planning benchmark set | heuristic computation effort | Improved |
| Preserve goal objects when constructing random object mappings (ablation) | Lifted homomorphism heuristics · Planning instances with large object reductions | initial-state heuristic value | Improved |
| Increase object reduction using type-preserving random mappings (ablation) | Lifted homomorphism heuristics · Planning instances | initial-state heuristic value | Hurt |
| Use different random object mappings at the same reduction level (ablation) | Lifted homomorphism heuristics · Planning instances | grounded task size | Mixed |
| Use goal-preserving random mappings instead of type-preserving mappings (ablation) | Optimal planning · 9-domain benchmark set (706 tasks) | coverage: 107, 115, 131, 140 -> 113, 132, 155, 162 | Improved |
| Use goal-preserving random mappings instead of type-preserving mappings (ablation) | Satisficing planning · 9-domain benchmark set (706 tasks) | coverage: 188, 168, 153, 140 -> 262, 252, 270, 265 | Improved |
| Use lifted homomorphism heuristics instead of fully grounded FF heuristics | Satisficing planning · GED and visitall-close | runtime | Improved |
| Use lifted homomorphism heuristics instead of lifted hadd | Satisficing planning · childsnack and pipesworld | runtime | Improved |
| Use lifted homomorphism heuristics instead of fully grounded planning | Optimal planning · blocksworld, logistics, pipesworld, and visitall-close | runtime | Improved |
| Use lifted homomorphism heuristics instead of lifted hmax | Optimal planning · Most evaluated domains | coverage | Improved |
Closest papers by meaning
- The FF Heuristic for Lifted Classical Planning (AAAI 2022 · similarity 0.92)
- Two Constraint Compilation Methods for Lifted Planning (AAAI 2026 · similarity 0.88)
- Bringing Order to Chaos – A Compact Representation of Partial Order in SAT-Based HTN Planning (AAAI 2019 · similarity 0.88)
- On Succinct Groundings of HTN Planning Problems (AAAI 2020 · similarity 0.88)
- Symmetries and Other Variations of “End-Recursive” HTN Problems: Mapping the Border Between Decidable and Undecidable Restrictions (AAAI 2026 · similarity 0.87)
- On the Computational Complexity of Plan Verification, (Bounded) Plan-Optimality Verification, and Bounded Plan Existence (AAAI 2024 · similarity 0.87)
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.
