37 search results - page 1 / 8 » Forward-Chaining Planning in Nondeterministic Domains |
AAAI
2004
13 years 6 months ago
2004
In this paper, we present a general technique for taking forward-chaining planners for deterministic domains (e.g., HSP, TLPlan, TALplanner, and SHOP2) and adapting them to work i...
IJCAI
2001
13 years 5 months ago
2001
Recently tremendous advances have been made in the performance of AI planning systems. However increased performance is only one of the prerequisites for bringing planning into th...
AIPS
2010
13 years 4 months ago
2010
Over the last few years there has been a revival of interest in the idea of least-commitment planning with a number of researchers returning to the partial-order planning approach...
AI
2011
Springer
12 years 11 months ago
2011
Springer
Planning graphs have been shown to be a rich source of heuristic information for many kinds of planners. In many cases, planners must compute a planning graph for each element of ...
AAAI
2004
13 years 6 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...