51 search results - page 1 / 11 » Observation Reduction for Strong Plans |
IJCAI
2007
13 years 5 months ago
2007
AIPS
2006
13 years 5 months ago
2006
Strong Cyclic Planning aims at generating iterative plans that only allow loops so far as there is a chance to reach the goal. The problem is already significantly complex for ful...
AAAI
2004
13 years 5 months ago
2004
Reactive planning using assumptions is a well-known approach to tackle complex planning problems for nondeterministic, partially observable domains. However, assumptions may be wr...
JAIR
2006
13 years 4 months ago
2006
In this paper, we present the partitioning of mutual-exclusion (mutex) constraints in temporal planning problems and its implementation in the SGPlan4 planner. Based on the strong...
PVLDB
2008
13 years 3 months ago
2008
Estimates of predicate selectivities by database query optimizers often differ significantly from those actually encountered during query execution, leading to poor plan choices a...