Pages that link to "Item:Q1380419"
From MaRDI portal
The following pages link to Complexity results for HTN planning (Q1380419):
Displaying 13 items.
- On the dynamic logic of agency and action (Q456961) (← links)
- Refining complexity analyses in planning by exploiting the exponential time hypothesis (Q504223) (← links)
- Task decomposition on abstract states, for planning under nondeterminism (Q835827) (← links)
- Multiple perspective dynamic decision making (Q1274561) (← links)
- HTN-like solutions for classical planning problems: an application to BDI agent systems (Q1727994) (← links)
- Complexity, decidability and undecidability results for domain-independent planning (Q1855230) (← links)
- Decidability and complexity of action-based temporal planning over dense time (Q2124463) (← links)
- Estimating the probability of meeting a deadline in schedules and plans (Q2321333) (← links)
- Review on hierarchical task network planning under uncertainty (Q2953906) (← links)
- More than a name? on implications of preconditions and effects of compound HTN planning tasks (Q4576178) (← links)
- KI 2003: Advances in Artificial Intelligence (Q5897313) (← links)
- On the complexity of the storyplan problem (Q6172205) (← links)
- Efficient optimal Kolmogorov approximation of random variables (Q6494381) (← links)
