Complexity results for HTN planning

DOI10.1007/BF02136175MaRDI QIDQ1380419zbMATH OpenWikidataFDO

Authors Kutluhan Erol, Dana S. Nau, James A. Hendler

Publication date 4 March 1998

Published in Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02136175

zbMATH Keywords

hierarchical task networkSTRIPS-style planning

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• On hierarchical task networks
• Planning in answer set programming using ordered task decomposition
• Planning in answer set programming using ordered task decomposition
• The computational complexity of propositional STRIPS planning

Cites work

• A Formal Definition for the Expressive Power of Terminological Knowledge Representation Languages
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 67474 (Why is no real title available?)
• Planning for conjunctive goals
• STRIPS: A new approach to the application of theorem proving to problem solving

Cited in

(22)

• Multiple perspective dynamic decision making
• HTN-like solutions for classical planning problems: an application to BDI agent systems
• Complexity, decidability and undecidability results for domain-independent planning
• Decidability and complexity of action-based temporal planning over dense time
• Estimating the probability of meeting a deadline in schedules and plans
• On hierarchical task networks
• Review on hierarchical task network planning under uncertainty
• Planning in answer set programming using ordered task decomposition
• On the dynamic logic of agency and action
• More than a name? on implications of preconditions and effects of compound HTN planning tasks
• Learning hierarchical task models from input traces
• Refining complexity analyses in planning by exploiting the exponential time hypothesis
• Planning with independent task networks
• Language classification of hierarchical planning problems
• Planning in answer set programming using ordered task decomposition
• On the complexity of the storyplan problem
• Efficient optimal Kolmogorov approximation of random variables
• Propositional dynamic logic formula synthesis and some applications
• Abstracting situation calculus action theories
• An extensive empirical evaluation of inferring preconditions and effects of compound tasks in ground HTN planning problems
• Symbolic search for cost-optimal planning with expressive model extensions
• Task decomposition on abstract states, for planning under nondeterminism

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)