58 search results - page 1 / 12 » Probabilistic Planning in the Graphplan Framework |
AIPS
2006
13 years 6 months ago
2006
We consider the problem of planning optimally in potentially concurrent probabilistic domains: actions have probabilistic effects and may execute in parallel under certain conditi...
ECP
1999
Springer
13 years 9 months ago
1999
Springer
We consider the problem of planning optimally in potentially concurrent probabilistic domains: actions have probabilistic effects and may execute in parallel under certain conditi...
AIPS
2003
13 years 6 months ago
2003
ECAI
2000
Springer
13 years 9 months ago
2000
Springer
We argued in our Flexible Graphplan (FGP) work that the classical definition of the planning problem is too rigid to capture the full subtlety of many real problems. In light of t...
ECP
1997
Springer
13 years 9 months ago
1997
Springer
We present a framework for encoding planning problems in logic programs with negation as failure, having computational e ciency as our major consideration. In order to accomplish o...