314 search results - page 16 / 63 » Goal Ordering in Partially Ordered Plans |
ECP
1997
Springer
13 years 11 months ago
1997
Springer
It is traditional wisdom that one should start from the goals when generating a plan in order to focus the plan generation process on potentially relevant actions. The graphplan sy...
PUK
2000
13 years 8 months ago
2000
In a real planning problem, there exists a set of constraints (both temporal constraints and resource usage constraints) which must be satisfied in order to obtain a feasible plan....
AAAI
2008
13 years 9 months ago
2008
We describe HTN-MAKER, an algorithm for learning hierarchical planning knowledge in the form of decomposition methods for Hierarchical Task Networks (HTNs). HTNMAKER takes as inpu...
AIPS
2007
13 years 9 months ago
2007
Many of the benchmark domains in AI planning are tractable on an individual basis. In this paper, we seek a theoretical, domain-independent explanation for their tractability. We ...
FLAIRS
2009
13 years 5 months ago
2009
Partially observable stochastic games (POSGs) provide a rich mathematical framework for planning under uncertainty by a group of agents. However, this modeling advantage comes wit...