Sciweavers

499 search results - page 35 / 100
» Model Minimization in Markov Decision Processes
Sort
View
ATAL
2007
Springer
15 years 6 months ago
Graphical models for online solutions to interactive POMDPs
We develop a new graphical representation for interactive partially observable Markov decision processes (I-POMDPs) that is significantly more transparent and semantically clear t...
Prashant Doshi, Yifeng Zeng, Qiongyu Chen
ATAL
2007
Springer
15 years 6 months ago
A globally optimal algorithm for TTD-MDPs
In this paper, we discuss the use of Targeted Trajectory Distribution Markov Decision Processes (TTD-MDPs)—a variant of MDPs in which the goal is to realize a specified distrib...
Sooraj Bhat, David L. Roberts, Mark J. Nelson, Cha...
ATAL
2010
Springer
15 years 28 days ago
Augmenting appearance-based localization and navigation using belief update
Appearance-based localization compares the current image taken from a robot's camera to a set of pre-recorded images in order to estimate the current location of the robot. S...
George Chrysanthakopoulos, Guy Shani
COMPLEX
2009
Springer
15 years 3 months ago
Non-sufficient Memories That Are Sufficient for Prediction
The causal states of computational mechanics define the minimal sufficient (prescient) memory for a given stationary stochastic process. They induce the -machine which is a hidden...
Wolfgang Löhr, Nihat Ay
ICML
2006
IEEE
16 years 19 days ago
PAC model-free reinforcement learning
For a Markov Decision Process with finite state (size S) and action spaces (size A per state), we propose a new algorithm--Delayed Q-Learning. We prove it is PAC, achieving near o...
Alexander L. Strehl, Lihong Li, Eric Wiewiora, Joh...