Sciweavers

332 search results - page 24 / 67
» Ranking policies in discrete Markov decision processes
Sort
View
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
13 years 5 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...
AAAI
2010
13 years 9 months ago
Using Bisimulation for Policy Transfer in MDPs
Knowledge transfer has been suggested as a useful approach for solving large Markov Decision Processes. The main idea is to compute a decision-making policy in one environment and...
Pablo Samuel Castro, Doina Precup
AUTOMATICA
2008
74views more  AUTOMATICA 2008»
13 years 8 months ago
Policy iteration based feedback control
It is well known that stochastic control systems can be viewed as Markov decision processes (MDPs) with continuous state spaces. In this paper, we propose to apply the policy iter...
Kan-Jian Zhang, Yan-Kai Xu, Xi Chen, Xi-Ren Cao
IJCAI
2007
13 years 9 months ago
An Experts Algorithm for Transfer Learning
A long-lived agent continually faces new tasks in its environment. Such an agent may be able to use knowledge learned in solving earlier tasks to produce candidate policies for it...
Erik Talvitie, Satinder Singh
IJCAI
2003
13 years 9 months ago
Multiple-Goal Reinforcement Learning with Modular Sarsa(0)
We present a new algorithm, GM-Sarsa(0), for finding approximate solutions to multiple-goal reinforcement learning problems that are modeled as composite Markov decision processe...
Nathan Sprague, Dana H. Ballard