914 search results - page 7 / 183 » The Computational Complexity of Probabilistic Planning |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
AIPS
1996
13 years 9 months ago
1996
Mostexisting decision-theoretic planners represent uncertainty about the state of the world with a precisely specified probability distribution over world states. This representat...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
While much work on learning in planning focused on learning domain physics (i.e., action models), and search control knowledge, little attention has been paid towards learning use...
PODS
2007
ACM
14 years 7 months ago
2007
ACM
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...
AIPS
2009
13 years 8 months ago
2009
Despite its ubiquitous presence, very little is known about the odds of winning the simple card game of Klondike Solitaire. The main goal of this paper is to investigate the use o...