28 search results - page 2 / 6 » Complexity of Probabilistic Planning under Average Rewards |
ALT
2006
Springer
14 years 1 months ago
2006
Springer
We address the problem of reinforcement learning in which observations may exhibit an arbitrary form of stochastic dependence on past observations and actions. The task for an age...
AIPS
2007
13 years 6 months ago
2007
Most traditional approaches to probabilistic planning in relationally specified MDPs rely on grounding the problem w.r.t. specific domain instantiations, thereby incurring a com...
IJRR
2011
12 years 11 months ago
2011
Abstract Partially observable Markov decision processes (POMDPs) are a principled mathematical framework for planning under uncertainty, a crucial capability for reliable operation...
CAV
2010
Springer
13 years 8 months ago
2010
Springer
Often one has a preference order among the different systems that satisfy a given specification. Under a probabilistic assumption about the possible inputs, such a preference order...
IROS
2007
IEEE
13 years 11 months ago
2007
IEEE
Abstract— Real-world robotic environments are highly structured. The scalability of planning and reasoning methods to cope with complex problems in such environments crucially de...