99 search results - page 4 / 20 » On the Hardness of Planning Problems with Simple Causal Grap... |
86
Voted
JAIR
2008
15 years 11 days ago
2008
We study the complexity of cost-optimal classical planning over propositional state variables and unary-effect actions. We discover novel problem fragments for which such optimiza...
101
click to vote
IJCAI
2003
15 years 1 months ago
2003
We examine the approach of encoding planning problems as CSPs more closely. First we present a simple CSP encoding for planning problems and then a set of transformations that can...
105
Voted
NETWORKS
2011
14 years 7 months ago
2011
Abstract. We consider a basic subproblem which arises in line planning, and is of particular importance in the context of a high system load or robustness: How much can be routed m...
119
Voted
AAAI
2008
15 years 2 months ago
2008
This paper investigates the impact of symbolic search for solving domain-independent action planning problems with binary decision diagrams (BDDs). Polynomial upper and exponential...
122
click to vote
FOCS
2002
IEEE
15 years 5 months ago
2002
IEEE
We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its...