914 search results - page 6 / 183 » The Computational Complexity of Probabilistic Planning |
AIPS
2006
13 years 9 months ago
2006
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 ...
FLAIRS
2008
13 years 10 months ago
2008
There are a lot of approaches for solving planning problems. Many of these approaches are based on `brute force` search methods and do not care about structures of plans previousl...
SOFSEM
2007
Springer
14 years 1 months ago
2007
Springer
In this work we assume that there is an agent in an unknown environment (domain). This agent has some predefined actions and it can perceive its current state in the environment c...
JAIR
2010
13 years 6 months ago
2010
Noisy probabilistic relational rules are a promising world model representation for several reasons. They are compact and generalize over world instantiations. They are usually in...
IPL
2006
13 years 7 months ago
2006
We investigate determining the exact bounds of the frequencies of conjunctions based on frequent sets. Our scenario is an important special case of some general probabilistic logi...