1995
DOI: 10.1111/j.1467-8640.1995.tb00052.x
|View full text |Cite
|
Sign up to set email alerts
|

COMPLEXITY RESULTS FOR SAS+ PLANNING

Abstract: We have previously reported a number of tractable planning problems defined in the SAS+ formalism. This article complements these results by providing a complete map over the complexity of SAS+ planning under all combinations of the previously considered restrictions. We analyze the complexity of both finding a minimal plan and finding any plan. In contrast to other complexity surveys of planning, we study not only the complexity of the decision problems but also the complexity of the generation problems. We p… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
363
0
3

Year Published

1999
1999
2016
2016

Publication Types

Select...
6
4

Relationship

1
9

Authors

Journals

citations
Cited by 362 publications
(367 citation statements)
references
References 13 publications
1
363
0
3
Order By: Relevance
“…In particular, we will use propositional STRIPS with negative goals (PSN) [8], which can alternatively be viewed as SAS + [6] restricted to boolean (i.e. two-valued) variable domains.…”
Section: Planningmentioning
confidence: 99%
“…In particular, we will use propositional STRIPS with negative goals (PSN) [8], which can alternatively be viewed as SAS + [6] restricted to boolean (i.e. two-valued) variable domains.…”
Section: Planningmentioning
confidence: 99%
“…The features that Fawcett et al exploited come from a number of different sources. They computed features by (a) considering different encodings of a planning problem (PDDL, SAT, SAS+) (Bäckström and Nebel 1995), (b) extracting pre-processing statistics, (c) analysing the search space topology (Hoffmann 2011b;2011a), and (d) considering probing features -brief runs of a planner on the considered problem, in order to extract information from its search trajectories. Their computation can take up to few minutes, according to the domain and the size of the considered problem.…”
Section: Limits Of Existing Features In the Cbp Contextmentioning
confidence: 99%
“…For generating the predictive models they extracted a large set of features, derived from the SAS+ formulation [3]. They compared the performance of a number of strategies for configuring a portfolio, and evaluated them on planners and benchmarks of IPC 2011.…”
Section: Studies On Planner Performance For Portfoliosmentioning
confidence: 99%