Sciweavers

AIPS
2008
13 years 7 months ago
The Complexity of Optimal Planning and a More Efficient Method for Finding Solutions
We present a faster method of solving optimal planning problems and show that our solution performs up to an order of magnitude faster than Satplan on a variety of problems from t...
Katrina Ray, Matthew L. Ginsberg
ALDT
2009
Springer
142views Algorithms» more  ALDT 2009»
13 years 11 months ago
Finding Best k Policies
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
Peng Dai, Judy Goldsmith