Pages that link to "Item:Q2473931"
From MaRDI portal
The following pages link to Understanding planning tasks. Domain complexity and heuristic decomposition (Q2473931):
Displaying 6 items.
- Refining complexity analyses in planning by exploiting the exponential time hypothesis (Q504223) (← links)
- Landmark-enhanced abstraction heuristics (Q1761301) (← links)
- Epistemic planning with attention as a bounded resource (Q2148811) (← links)
- DEL-based epistemic planning: decidability and complexity (Q2211863) (← links)
- Conflict-based search for optimal multi-agent pathfinding (Q2343829) (← links)
- More than a name? on implications of preconditions and effects of compound HTN planning tasks (Q4576178) (← links)