Complexity results for HTN planning
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 67474 (Why is no real title available?)
- A Formal Definition for the Expressive Power of Terminological Knowledge Representation Languages
- Planning for conjunctive goals
- STRIPS: A new approach to the application of theorem proving to problem solving
Cited in
(18)- Learning hierarchical task models from input traces
- Complexity, decidability and undecidability results for domain-independent planning
- Review on hierarchical task network planning under uncertainty
- Efficient optimal Kolmogorov approximation of random variables
- More than a name? on implications of preconditions and effects of compound HTN planning tasks
- Estimating the probability of meeting a deadline in schedules and plans
- HTN-like solutions for classical planning problems: an application to BDI agent systems
- Planning with independent task networks
- Multiple perspective dynamic decision making
- Task decomposition on abstract states, for planning under nondeterminism
- On hierarchical task networks
- Language classification of hierarchical planning problems
- Planning in answer set programming using ordered task decomposition
- Decidability and complexity of action-based temporal planning over dense time
- Planning in answer set programming using ordered task decomposition
- On the complexity of the storyplan problem
- Refining complexity analyses in planning by exploiting the exponential time hypothesis
- On the dynamic logic of agency and action
This page was built for publication: Complexity results for HTN planning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1380419)
