Complexity, decidability and undecidability results for domain-independent planning
From MaRDI portal
Publication:1855230
DOI10.1016/0004-3702(94)00080-KzbMath1013.68548WikidataQ62046408 ScholiaQ62046408MaRDI QIDQ1855230
Kutluhan Erol, V. S. Subrahmanian, Dana S. Nau
Publication date: 4 February 2003
Published in: Artificial Intelligence (Search for Journal in Brave)
Related Items (26)
Decidability and complexity of action-based temporal planning over dense time ⋮ The computational complexity of propositional STRIPS planning ⋮ Concise finite-domain representations for PDDL planning tasks ⋮ Strong planning under uncertainty in domains with numerous but identical elements (a generic approach) ⋮ Maintenance goals of agents in a dynamic environment: formulation and policy construction ⋮ Engineering and compiling planning domain models to promote validity and efficiency ⋮ On the nature and role of modal truth criteria in planning ⋮ Complexity of Planning in Action Formalisms Based on Description Logics ⋮ Hybrid conditional planning using answer set programming ⋮ Specifying and computing preferred plans ⋮ Plan aggregation for strong cyclic planning in nondeterministic domains ⋮ HTN-like solutions for classical planning problems: an application to BDI agent systems ⋮ In defense of PDDL axioms ⋮ Finding optimal plans for multiple teams of robots through a mediator: A logic-based approach ⋮ Deliberative acting, planning and learning with hierarchical operational models ⋮ On the complexity of blocks-world planning ⋮ A state space analysis of propose-and-revise ⋮ On-the-Fly Macros ⋮ Formalizing narratives using nested circumscription ⋮ The logical foundations of goal-regression planning in autonomous agents ⋮ Computational complexity of planning and approximate planning in the presence of incompleteness ⋮ FROM PLANNING TO SEARCHING FOR THE SHORTEST PLAN: AN OPTIMAL TRANSITION ⋮ Complexity, decidability and undecidability results for domain-independent planning ⋮ Actions over core-closed knowledge bases ⋮ On the computational complexity of temporal projection, planning, and plan validation ⋮ Complexity results for standard benchmark domains in planning
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Planning for conjunctive goals
- On the complexity of blocks-world planning
- Reasoning about partially ordered events
- Complexity results for HTN planning
- Planning in a hierarchy of abstraction spaces
- Complexity, decidability and undecidability results for domain-independent planning
- STRIPS: A new approach to the application of theorem proving to problem solving
- Regression planning
This page was built for publication: Complexity, decidability and undecidability results for domain-independent planning
