Pages that link to "Item:Q5494855"
From MaRDI portal
The following pages link to Improving Delete Relaxation Heuristics Through Explicitly Represented Conjunctions (Q5494855):
Displaying 9 items.
- On the completeness of pruning techniques for planning with conditional effects (Q473577) (← links)
- State space search nogood learning: online refinement of critical-path dead-end detectors in planning (Q514137) (← links)
- Gradient-based mixed planning with symbolic and numeric action parameters (Q2093396) (← links)
- Set-structured and cost-sharing heuristics for classical planning (Q2268919) (← links)
- Red-black planning: a new systematic approach to partial delete relaxation (Q2344359) (← links)
- Heuristics for planning with penalties and rewards formulated in logic and computed through circuits (Q2389669) (← links)
- (Q3783442) (← links)
- Online Relaxation Refinement for Satisficing Planning: On Partial Delete Relaxation, Complete Hill-Climbing, and Novelty Pruning (Q5026253) (← links)
- Combining the Delete Relaxation with Critical-Path Heuristics: A Direct Characterization (Q5739833) (← links)