62 search results - page 2 / 13 » Probabilistic inference for solving discrete and continuous ... |
CORR
2010
Springer
13 years 6 months ago
2010
Springer
We study the convergence of Markov Decision Processes made of a large number of objects to optimization problems on ordinary differential equations (ODE). We show that the optimal...
NIPS
2003
13 years 7 months ago
2003
Approximate linear programming (ALP) has emerged recently as one of the most promising methods for solving complex factored MDPs with finite state spaces. In this work we show th...
IROS
2009
IEEE
14 years 19 days ago
2009
IEEE
— Partially Observable Markov Decision Processes (POMDPs) provide a rich mathematical model to handle realworld sequential decision processes but require a known model to be solv...
AIPS
2011
12 years 9 months ago
2011
In this paper, we present a new algorithm that integrates recent advances in solving continuous bandit problems with sample-based rollout methods for planning in Markov Decision P...
IJCAI
2007
13 years 7 months ago
2007
Agents often have to construct plans that obey deadlines or, more generally, resource limits for real-valued resources whose consumption can only be characterized by probability d...