Pages that link to "Item:Q2871457"
From MaRDI portal
The following pages link to The complexity of optimal monotonic planning: the bad, the good, and the causal graph (Q2871457):
Displaying 7 items.
- Limitations of acyclic causal graphs for planning (Q490647) (← links)
- On the complexity of blocks-world planning (Q1199914) (← links)
- A framework for analysing state-abstraction methods (Q2060741) (← links)
- Red-black planning: a new systematic approach to partial delete relaxation (Q2344359) (← links)
- Analyzing Search Topology Without Running Any Search: On the Connection Between Causal Graphs and h+ (Q3007563) (← links)
- Cost-optimal Planning, Delete Relaxation, Approximability, and Heuristics (Q5145837) (← links)
- Monotone Temporal Planning: Tractability, Extensions and Applications (Q5494854) (← links)