Sciweavers

JAIR
2008
99views more  JAIR 2008»
13 years 4 months ago
The Complexity of Planning Problems With Simple Causal Graphs
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...
Omer Giménez, Anders Jonsson
AIPS
2007
13 years 7 months ago
On the Hardness of Planning Problems with Simple Causal Graphs
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...
Omer Giménez, Anders Jonsson