216 search results - page 1 / 44 » The Complexity of Planning Problems With Simple Causal Graph... |
JAIR
2008
13 years 4 months ago
2008
We present three new complexity results for classes of planning problems with simple causal graphs. First, we describe a polynomial-time algorithm that uses macros to generate pla...
AIPS
2007
13 years 6 months ago
2007
We present three new complexity results for classes of planning problems with simple causal graphs. First, we describe a polynomial time algorithm that uses macros to generate pla...
AIPS
2008
13 years 6 months ago
2008
The causal graph is a directed graph that describes the variable dependencies present in a planning instance. A number of papers have studied the causal graph in both practical an...
AIPS
2008
13 years 6 months ago
2008
Recently, considerable focus has been given to the problem of determining the boundary between tractable and intractable planning problems. To this end, we present complexity resu...
AIPS
2009
13 years 5 months ago
2009
A planning problem is k-dependent if each action has at most k pre-conditions on variables unaffected by the action. This concept is well-founded since k is a constant for all but...