914 search results - page 1 / 183 » The Computational Complexity of Probabilistic Planning |
CORR
1998
Springer
13 years 4 months ago
1998
Springer
We examine the computational complexity of testing and nding small plans in probabilistic planning domains with both at and propositional representations. The complexity of plan e...
ECP
1997
Springer
13 years 8 months ago
1997
Springer
A possibilistic approach of planning under uncertainty has been developed recently. It applies to problems in which the initial state is partially known and the actions have graded...
IJCAI
2001
13 years 5 months ago
2001
A general and expressive model of sequential decision making under uncertainty is provided by the Markov decision processes (MDPs) framework. Complex applications with very large ...
ICDT
2009
ACM
14 years 5 months ago
2009
ACM
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
BIRTHDAY
2005
Springer
13 years 10 months ago
2005
Springer
In this paper we present an overview of recent developments in the plan-based control of autonomous robots. We identify computational principles that enable autonomous robots to a...