Sciweavers

83 search results - page 3 / 17
» Building efficient partial plans using Markov decision proce...
Sort
View
ICML
2006
IEEE
15 years 10 months ago
Learning the structure of Factored Markov Decision Processes in reinforcement learning problems
Recent decision-theoric planning algorithms are able to find optimal solutions in large problems, using Factored Markov Decision Processes (fmdps). However, these algorithms need ...
Thomas Degris, Olivier Sigaud, Pierre-Henri Wuille...
IJCAI
2007
14 years 11 months ago
A Fast Analytical Algorithm for Solving Markov Decision Processes with Real-Valued Resources
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...
Janusz Marecki, Sven Koenig, Milind Tambe
136
Voted
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
14 years 7 months ago
Efficient Planning in Large POMDPs through Policy Graph Based Factorized Approximations
Partially observable Markov decision processes (POMDPs) are widely used for planning under uncertainty. In many applications, the huge size of the POMDP state space makes straightf...
Joni Pajarinen, Jaakko Peltonen, Ari Hottinen, Mik...
JAIR
2002
120views more  JAIR 2002»
14 years 9 months ago
Learning Geometrically-Constrained Hidden Markov Models for Robot Navigation: Bridging the Topological-Geometrical Gap
Hidden Markov models hmms and partially observable Markov decision processes pomdps provide useful tools for modeling dynamical systems. They are particularly useful for represent...
Hagit Shatkay, Leslie Pack Kaelbling
IJCAI
2001
14 years 11 months ago
An Improved Grid-Based Approximation Algorithm for POMDPs
Although a partially observable Markov decision process (POMDP) provides an appealing model for problems of planning under uncertainty, exact algorithms for POMDPs are intractable...
Rong Zhou, Eric A. Hansen