638 search results - page 3 / 128 » A New Approach to Tractable Planning |
FLAIRS
2008
13 years 8 months ago
2008
Solving relaxed problems is a commonly used technique in heuristic search to derive heuristic estimates. In heuristic planning, this is usually done by expanding a planning (reach...
AIPS
2004
13 years 7 months ago
2004
Conformant planning is the task of generating plans given uncertainty about the initial state and action effects, and without any sensing capabilities during plan execution. The p...
AIPS
2009
13 years 6 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...
UAI
1997
13 years 7 months ago
1997
Much recent research in decision theoretic planning has adopted Markov decision processes (MDPs) as the model of choice, and has attempted to make their solution more tractable by...
IJCAI
1993
13 years 7 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...