Improving delete relaxation heuristics through explicitly represented conjunctions
From MaRDI portal
Recommendations
- Combining the Delete Relaxation with Critical-Path Heuristics: A Direct Characterization
- Red-black planning: a new systematic approach to partial delete relaxation
- Solving delete free planning with relaxed decision diagram based heuristics
- Cost-optimal planning, delete relaxation, approximability, and heuristics
- An LP-Based Heuristic for Optimal Planning
Cited in
(13)- scientific article; zbMATH DE number 4046981 (Why is no real title available?)
- An LP-Based Heuristic for Optimal Planning
- Red-black planning: a new systematic approach to partial delete relaxation
- Strengthening landmark heuristics via hitting sets
- Heuristics for planning with penalties and rewards formulated in logic and computed through circuits
- Set-structured and cost-sharing heuristics for classical planning
- On the completeness of pruning techniques for planning with conditional effects
- Solving delete free planning with relaxed decision diagram based heuristics
- scientific article; zbMATH DE number 2243410 (Why is no real title available?)
- State space search nogood learning: online refinement of critical-path dead-end detectors in planning
- Gradient-based mixed planning with symbolic and numeric action parameters
- Online relaxation refinement for satisficing planning: on partial delete relaxation, complete hill-climbing, and novelty pruning
- Combining the Delete Relaxation with Critical-Path Heuristics: A Direct Characterization
This page was built for publication: Improving delete relaxation heuristics through explicitly represented conjunctions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5494855)
