Sciweavers

288 search results - page 14 / 58
» Risk-averse dynamic programming for Markov decision processe...
Sort
View
NIPS
2008
14 years 11 months ago
The Infinite Factorial Hidden Markov Model
We introduce a new probability distribution over a potentially infinite number of binary Markov chains which we call the Markov Indian buffet process. This process extends the IBP...
Jurgen Van Gael, Yee Whye Teh, Zoubin Ghahramani
JAIR
2006
122views more  JAIR 2006»
14 years 9 months ago
Solving Factored MDPs with Hybrid State and Action Variables
Efficient representations and solutions for large decision problems with continuous and discrete variables are among the most important challenges faced by the designers of automa...
Branislav Kveton, Milos Hauskrecht, Carlos Guestri...
UAI
2003
14 years 11 months ago
Symbolic Generalization for On-line Planning
Symbolic representations have been used successfully in off-line planning algorithms for Markov decision processes. We show that they can also improve the performance of online p...
Zhengzhu Feng, Eric A. Hansen, Shlomo Zilberstein
AAAI
2010
14 years 11 months ago
Relational Partially Observable MDPs
Relational Markov Decision Processes (MDP) are a useraction for stochastic planning problems since one can develop abstract solutions for them that are independent of domain size ...
Chenggang Wang, Roni Khardon
JAIR
2010
115views more  JAIR 2010»
14 years 8 months ago
An Investigation into Mathematical Programming for Finite Horizon Decentralized POMDPs
Decentralized planning in uncertain environments is a complex task generally dealt with by using a decision-theoretic approach, mainly through the framework of Decentralized Parti...
Raghav Aras, Alain Dutech