Tractable Plan Existence Does Not Imply Tractable Plan Generation (1998)
| Venue: | Annals of Mathematics and Artificial Intelligence |
| Citations: | 12 - 1 self |
BibTeX
@ARTICLE{Jonsson98tractableplan,
author = {Peter Jonsson and Christer Bäckström},
title = {Tractable Plan Existence Does Not Imply Tractable Plan Generation},
journal = {Annals of Mathematics and Artificial Intelligence},
year = {1998},
volume = {22},
pages = {281--296}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We present a class, 3S, of planning instances such that the plan existence problem is tractable while plan generation is provably intractable for instances of this class. The class is defined by simple structural restrictions, all of them testable in polynomial-time. Furthermore, we show that plan generation can be carried out in time bounded by a polynomial in the size of the input and the size of the generated solution. For this class, we propose a provably sound and complete incremental planner, i.e., a planner that can usually output an executable prefix of the final plan before it has generated the whole plan. Keywords: Artificial intelligence; Planning; Computational complexity. AMS Classification: Primary: 68T20; Secondary: 68Q25. 1 Introduction It is well-known that planning is computationally difficult in the general case; plan existence for Strips-style formalisms is undecidable in the first-order case [6] and Pspace-complete for all common propositional variants [5, 2]. M...
Citations
No citations identified.
