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...
IJCAI
1993
13 years 5 months ago
1993
One method for reducing the time required for plan generation is to learn search control rules from experience. Most of the recent work in learning search control knowledge has co...
AIPS
2006
13 years 5 months ago
2006
Planning for partially observable, nondeterministic domains is a very signi cant and computationally hard problem. Often, reasonable assumptions can be drawn over expected/nominal...
ATAL
2004
Springer
13 years 8 months ago
2004
Springer
As planning agents grow more sophisticated, issues of plan representation arise alongside concerns with plan generation. Planning methods work over increasingly large and difficul...