Pages that link to "Item:Q5739833"
From MaRDI portal
The following pages link to Combining the Delete Relaxation with Critical-Path Heuristics: A Direct Characterization (Q5739833):
Displaying 8 items.
- State space search nogood learning: online refinement of critical-path dead-end detectors in planning (Q514137) (← 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)
- Analyzing Search Topology Without Running Any Search: On the Connection Between Causal Graphs and h+ (Q3007563) (← links)
- On a Practical, Integer-Linear Programming Model for Delete-Free Tasks and its Use as a Heuristic for Cost-Optimal Planning (Q3460384) (← links)
- Online Relaxation Refinement for Satisficing Planning: On Partial Delete Relaxation, Complete Hill-Climbing, and Novelty Pruning (Q5026253) (← links)
- Cost-optimal Planning, Delete Relaxation, Approximability, and Heuristics (Q5145837) (← links)
- Improving Delete Relaxation Heuristics Through Explicitly Represented Conjunctions (Q5494855) (← links)
