656 search results - page 40 / 132 » Complexity of finite-horizon Markov decision process problem... |
ICRA
2007
IEEE
15 years 8 months ago
2007
IEEE
— While the Partially Observable Markov Decision Process (POMDP) provides a formal framework for the problem of robot control under uncertainty, it typically assumes a known and ...
149
click to vote
ICML
2006
IEEE
2006
IEEE
Automatic basis function construction for approximate dynamic programming and reinforcement learning
15 years 8 months ago
We address the problem of automatically constructing basis functions for linear approximation of the value function of a Markov Decision Process (MDP). Our work builds on results ...
AAAI
1994
15 years 3 months ago
1994
In this paper, we describe the partially observable Markov decision process pomdp approach to nding optimal or near-optimal control strategies for partially observable stochastic ...
137
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Event-driven automation of reactive functionalities for complex event processing is an urgent need in today's distributed service-oriented architectures and Web-based event-d...
122
click to vote
ATAL
2009
Springer
15 years 8 months ago
2009
Springer
One of the key problems in reinforcement learning is balancing exploration and exploitation. Another is learning and acting in large or even continuous Markov decision processes (...