Sciweavers

200 search results - page 2 / 40
» Point-Based Policy Iteration
Sort
View
JAIR
2006
160views more  JAIR 2006»
13 years 5 months ago
Anytime Point-Based Approximations for Large POMDPs
The Partially Observable Markov Decision Process has long been recognized as a rich framework for real-world planning and control problems, especially in robotics. However exact s...
Joelle Pineau, Geoffrey J. Gordon, Sebastian Thrun
MICCAI
2007
Springer
14 years 6 months ago
Shape Analysis Using a Point-Based Statistical Shape Model Built on Correspondence Probabilities
A fundamental problem when computing statistical shape models is the determination of correspondences between the instances of the associated data set. Often, homologies between po...
Heike Hufnagel, Xavier Pennec, Jan Ehrhardt, Heinz...
ECML
2006
Springer
13 years 9 months ago
Prioritizing Point-Based POMDP Solvers
Recent scaling up of POMDP solvers towards realistic applications is largely due to point-based methods such as PBVI, Perseus, and HSVI, which quickly converge to an approximate so...
Guy Shani, Ronen I. Brafman, Solomon Eyal Shimony
CORR
2007
Springer
94views Education» more  CORR 2007»
13 years 5 months ago
Paging and Registration in Cellular Networks: Jointly Optimal Policies and an Iterative Algorithm
— This paper explores optimization of paging and registration policies in cellular networks. Motion is modeled as a discrete-time Markov process, and minimization of the discount...
Bruce Hajek, Kevin Mitzel, Sichao Yang
ML
2008
ACM
152views Machine Learning» more  ML 2008»
13 years 5 months ago
Learning near-optimal policies with Bellman-residual minimization based fitted policy iteration and a single sample path
Abstract. We consider batch reinforcement learning problems in continuous space, expected total discounted-reward Markovian Decision Problems. As opposed to previous theoretical wo...
András Antos, Csaba Szepesvári, R&ea...