Complexity, decidability and undecidability results for domain-independent planning
Artificial Intelligence - Special volume on planning and scheduling
Hybrid planning for partially hierarchical domains
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
An Argument for a Hybrid HTN/Operator-Based Approach to Planning
ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
Combining Domain-Independent Planning and HTN Planning: The Duet Planner
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
A unifying framework for hybrid planning and scheduling
KI'06 Proceedings of the 29th annual German conference on Artificial intelligence
| Hi-index | 0.00 |
The field of deterministic AI planning can roughly be divided into two approaches -- classical state-based planning and hierarchical task network (HTN) planning. The plan existence problem of the former is known to be decidable while it has been proved undecidable for the latter. When extending HTN planning by allowing the unrestricted insertion of tasks and ordering constraints, one obtains a form of planning which is often referred to as "hybrid planning". We present a simplified formalization of HTN planning with and without task insertion. We show that the plan existence problem is undecidable for the HTN setting without task insertion and that it becomes decidable when allowing task insertion. In the course of the proof, we obtain an upper complexity bound of EXPSPACE for the plan existence problem for propositional HTN planning with task insertion.