Results 1  10
of
27
Complexity Results for SAS+ Planning
 COMPUTATIONAL INTELLIGENCE
, 1993
"... We have previously reported a number of tractable planning problems defined in the SAS+ formalism. This report 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 ..."
Abstract

Cited by 144 (24 self)
 Add to MetaCart
We have previously reported a number of tractable planning problems defined in the SAS+ formalism. This report 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 both of finding a minimal plan and of finding any plan. In contrast to other complexity surveys of planning we study not only the complexity of the decision problems but also of the generation problems. We prove that the SAS+PUS problem is the maximal tractable problem under the restrictions we have considered if we want to generate minimal plans. If we are satisfied with any plan, then we can generalize further to the SAS+US problem, which we prove to be the maximal tractable problem in this case.
Complexity, Decidability and Undecidability Results for DomainIndependent Planning
 ARTIFICIAL INTELLIGENCE
, 1995
"... In this paper, we examine how the complexity of domainindependent planning with STRIPSstyle operators depends on the nature of the planning operators. We show ..."
Abstract

Cited by 132 (25 self)
 Add to MetaCart
In this paper, we examine how the complexity of domainindependent planning with STRIPSstyle operators depends on the nature of the planning operators. We show
Structure and Complexity in Planning with Unary Operators
 Journal of Artificial Intelligence Research
, 2003
"... Unary operator domains  i.e., domains in which operators have a single effect  arise naturally in many control problems. In its most general form, the problem of strips planning in unary operator domains is known to be as hard as the general strips planning problem  both are pspacecomplete. H ..."
Abstract

Cited by 42 (8 self)
 Add to MetaCart
Unary operator domains  i.e., domains in which operators have a single effect  arise naturally in many control problems. In its most general form, the problem of strips planning in unary operator domains is known to be as hard as the general strips planning problem  both are pspacecomplete. However, unary operator domains induce a natural structure, called the domain's causal graph. This graph relates between the preconditions and effect of each domain operator. Causal graphs were exploited by Williams and Nayak in order to analyze plan generation for one of the controllers in NASA's DeepSpace One spacecraft. There, they utilized the fact that when this graph is acyclic, a serialization ordering over any subgoal can be obtained quickly. In this paper we conduct a comprehensive study of the relationship between the structure of a domain's causal graph and the complexity of planning in this domain. On the positive side, we show that a nontrivial polynomial time plan generation algorithm exists for domains whose causal graph induces a polytree with a constant bound on its node indegree. On the negative side, we show that even plan existence is hard when the graph is a directedpath singly connected DAG.
Statevariable planning under structural restrictions: Algorithms and complexity
 ARTIFICIAL INTELLIGENCE
, 1998
"... Computationally tractable planning problems reported in the literature so far have almost exclusively been defined by syntactical restrictions. To better exploit the inherent structure in problems, it is probably necessary to study also structural restrictions on the underlying statetransition grap ..."
Abstract

Cited by 39 (3 self)
 Add to MetaCart
Computationally tractable planning problems reported in the literature so far have almost exclusively been defined by syntactical restrictions. To better exploit the inherent structure in problems, it is probably necessary to study also structural restrictions on the underlying statetransition graph. The exponential size of this graph, though, makes such restrictions costly to test. Hence, we propose an intermediate approach, using a state variable model for planning and defining restrictions on the separate statetransition graphs for each state variable. We identify such restrictions which can tractably be tested and we present a planning algorithm which is correct and runs in polynomial time under these restrictions. The algorithm has been implemented an it outperforms Graphplan on a number of test instances. In addition, we present an exhaustive map of the complexity results for planning under all combinations of four previously studied syntactical restrictions and our five new structural restrictions. This complexity map considers both the optimal and nonoptimal plan generation problem.
Parallel nonbinary planning in polynomial time
 In Reiter and Mylopoulos [ 1991
, 1991
"... This paper formally presents a class of planning problems which allows nonbinary state variables and parallel execution of actions. The class is proven to be tractable, and we provide a sound and complete polynomial time algorithm for planning within this class. This result means that we are gettin ..."
Abstract

Cited by 31 (12 self)
 Add to MetaCart
This paper formally presents a class of planning problems which allows nonbinary state variables and parallel execution of actions. The class is proven to be tractable, and we provide a sound and complete polynomial time algorithm for planning within this class. This result means that we are getting closei to tackling realistic planning problems in sequential control, where a restricted problem representation is often sufficient, but where the size of the problems make tractability an important issue. 1
Expressive Equivalence of Planning Formalisms
 Artificial Intelligence
, 1995
"... A concept of expressive equivalence for planning formalisms based on polynomial transformations is defined. It is argued that this definition is reasonable and useful both from a theoretical and from a practical perspective; if two languages are equivalent, then theoretical results carry over an ..."
Abstract

Cited by 30 (11 self)
 Add to MetaCart
A concept of expressive equivalence for planning formalisms based on polynomial transformations is defined. It is argued that this definition is reasonable and useful both from a theoretical and from a practical perspective; if two languages are equivalent, then theoretical results carry over and, more practically, we can model an application problem in one language and then easily use a planner for the other language. In order to cope with the problem of exponentially sized solutions for planning problems an even stronger concept of expressive equivalence is introduced, using the novel ESPreduction. Four different formalisms for propositional planning are then analyzed, namely two variants of STRIPS, ground TWEAK and the SAS + formalism. Although these may seem to exhibit different degrees of expressive power, it is proven that they are, in fact, expressively equivalent under ESP reduction. This means that neither negative goals, partial initial states nor multivalue...
Equivalence and Tractability Results for SAS+ Planning
 Proceedings of the 3rd International Conference on Principles on Knowledge Representation and Reasoning (KR92
, 1992
"... We define the SAS + planning formalism, which generalizes the previously presented SAS formalism. The SAS + formalism is compared with some betterknown propositionalplanning formalisms with respect to expressiveness. Contrary to intuition, all formalisms turn out to be equally expressive in a v ..."
Abstract

Cited by 22 (6 self)
 Add to MetaCart
We define the SAS + planning formalism, which generalizes the previously presented SAS formalism. The SAS + formalism is compared with some betterknown propositionalplanning formalisms with respect to expressiveness. Contrary to intuition, all formalisms turn out to be equally expressive in a very strong sense. We further present the SAS + PUS planning problem which generalizes the previously presented, tractable SASPUS problem. We prove that also the SAS +  PUS problem is tractable by devising a provably correct polynomial time algorithm for this problem. 1 Introduction Much effort has gone into finding more and more general formalisms, mainly logicbased, for plans and actions and also into finding reasoning methods for these. Although such formalisms may be important for modelling problems and comparing different approaches we most probably have to identify subproblems and devise tailored algorithms for these in order to overcome the computational difficulties involved. ...
New islands of tractability of costoptimal planning
 JAIR
, 2008
"... We study the complexity of costoptimal classical planning over propositional state variables and unaryeffect actions. We discover novel problem fragments for which such optimization is tractable, and identify certain conditions that differentiate between tractable and intractable problems. These r ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
We study the complexity of costoptimal classical planning over propositional state variables and unaryeffect actions. We discover novel problem fragments for which such optimization is tractable, and identify certain conditions that differentiate between tractable and intractable problems. These results are based on exploiting both structural and syntactic characteristics of planning problems. Specifically, following Brafman and Domshlak (2003), we relate the complexity of planning and the topology of the causal graph. The main results correspond to tractability of costoptimal planning for propositional problems with polytree causal graphs that either have O(1)bounded indegree, or are induced by actions having at most one prevail condition each. Almost all our tractability results are based on a constructive proof technique that connects between certain tools from planning and tractable constraint optimization, and we believe this technique is of interest on its own due to a clear evidence for its robustness.
Tractable Planning for an Assembly Line
, 1995
"... The industry wants formal methods for dealing with combinatorial dynamical systems that are provably correct and fast. One example of such problems is error recovery in industrial processes. We have used a provably correct, polynomialtime planning algorithm to plan for a miniature assembly line ..."
Abstract

Cited by 10 (7 self)
 Add to MetaCart
The industry wants formal methods for dealing with combinatorial dynamical systems that are provably correct and fast. One example of such problems is error recovery in industrial processes. We have used a provably correct, polynomialtime planning algorithm to plan for a miniature assembly line, which assembles toy cars. Although somewhat limited, this process has many similarities with real industrial processes. By exploring the structure of this assembly line we have extended a previously presented algorithm making the class of problems that can be handled in polynomial time larger.
Automatic Creation of Sequential Control Schemes in Polynomial Time
 In Proceedings of the 32nd Conference on Decision and Control
, 1992
"... Of all hard and software developed for industrial control purposes, the majority is devoted to sequential, or binary valued, control and only a minor part to classical linear control. The sequential parts of the controller are typically invoked during startup or shutdown phases to bring the system ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
Of all hard and software developed for industrial control purposes, the majority is devoted to sequential, or binary valued, control and only a minor part to classical linear control. The sequential parts of the controller are typically invoked during startup or shutdown phases to bring the system either into its normal operating region or into some safe standby region. Despite its importance, fairly little theoretical research has been devoted to this area, and sequential control programs are still created manually without much support for a systematic approach. We propose a method to create sequential control programs automatically and online upon request, for example when a plant fault has occurred. The main idea is to spend some effort offline on modeling the process, and from this model generate the control strategy, i.e. the plan. Here we present a planning tool implemented in a realtime expert system called G2. The planning system contains algorithms for creating plans in ...