Planning over chain causal graphs for variables with domains of size 5 is NP-hard
Omer Giménez, Anders Jonsson · 2009
Recently, considerable focus has been given to the problem of determining the boundary between tractable and intractable planning problems. In this paper, we study the complexity of planning in the class C n of planning problems, characterized by unary operators and directed path causal graphs. Although this is one of the simplest forms of causal graphs a planning problem can have, we show that planning is intractable for C n (unless P = NP), even if the domains of state variables have bounded size. In particular, we show that plan existence for C k n is NP-hard for k ≥ 5 by reduction from Cnf-Sat. Here, k denotes the upper bound on the size of the state variable domains. Our result reduces the complexity gap for the class C k n to cases k = 3 and k = 4 only, since C 2 n is known to be tractable. 1.