Pages that link to "Item:Q1292308"
From MaRDI portal
The following pages link to Using regression-match graphs to control search in planning (Q1292308):
Displayed 14 items.
- On the completeness of pruning techniques for planning with conditional effects (Q473577) (← links)
- State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning (Q543630) (← links)
- The computational complexity of avoiding spurious states in state space abstraction (Q622104) (← links)
- Multiobjective heuristic state-space planning (Q814441) (← links)
- Learning from planner performance (Q835821) (← links)
- Star-topology decoupled state space search (Q1749386) (← 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)
- Planning with Incomplete Information (Q3003424) (← links)
- Directed Unfolding of Petri Nets (Q3599218) (← links)
- Planning as heuristic search (Q5941310) (← links)
- Planning and control in artificial intelligence: A unifying perspective (Q5945807) (← links)
- Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search (Q5958540) (← links)