Sciweavers

66 search results - page 1 / 14
» Using Caching to Solve Larger Probabilistic Planning Problem...
Sort
View
AAAI
1998
13 years 6 months ago
Using Caching to Solve Larger Probabilistic Planning Problems
Probabilistic planning algorithms seek e ective plans for large, stochastic domains. maxplan is a recently developed algorithm that converts a planning problem into an E-Majsat pr...
Stephen M. Majercik, Michael L. Littman
AIPS
2006
13 years 6 months ago
Combining Knowledge Compilation and Search for Conformant Probabilistic Planning
We present a new algorithm for conformant probabilistic planning, which for a given horizon produces a plan that maximizes the probability of success under quantified uncertainty ...
Jinbo Huang
KR
1994
Springer
13 years 9 months ago
Risk-Sensitive Planning with Probabilistic Decision Graphs
Probabilistic AI planning methods that minimize expected execution cost have a neutral attitude towards risk. We demonstrate how one can transform planning problems for risk-sensi...
Sven Koenig, Reid G. Simmons
ECP
1999
Springer
190views Robotics» more  ECP 1999»
13 years 9 months ago
Probabilistic Planning in the Graphplan Framework
We consider the problem of planning optimally in potentially concurrent probabilistic domains: actions have probabilistic effects and may execute in parallel under certain conditi...
Avrim Blum, John Langford
AIPS
2006
13 years 6 months ago
Concurrent Probabilistic Planning in the Graphplan Framework
We consider the problem of planning optimally in potentially concurrent probabilistic domains: actions have probabilistic effects and may execute in parallel under certain conditi...
Iain Little, Sylvie Thiébaux