Sciweavers

771 search results - page 110 / 155
» Markov Decision Processes with Arbitrary Reward Processes
Sort
View
AAAI
2006
15 years 3 months ago
Point-based Dynamic Programming for DEC-POMDPs
We introduce point-based dynamic programming (DP) for decentralized partially observable Markov decision processes (DEC-POMDPs), a new discrete DP algorithm for planning strategie...
Daniel Szer, François Charpillet
AIPS
2004
15 years 3 months ago
Learning Domain-Specific Control Knowledge from Random Walks
We describe and evaluate a system for learning domainspecific control knowledge. In particular, given a planning domain, the goal is to output a control policy that performs well ...
Alan Fern, Sung Wook Yoon, Robert Givan
AIPS
2006
15 years 3 months ago
Solving Factored MDPs with Exponential-Family Transition Models
Markov decision processes (MDPs) with discrete and continuous state and action components can be solved efficiently by hybrid approximate linear programming (HALP). The main idea ...
Branislav Kveton, Milos Hauskrecht
128
Voted
ICMLA
2004
15 years 3 months ago
Planning with predictive state representations
Predictive state representation (PSR) models for controlled dynamical systems have recently been proposed as an alternative to traditional models such as partially observable Mark...
Michael R. James, Satinder P. Singh, Michael L. Li...
107
Voted
IJCAI
2003
15 years 3 months ago
Automated Generation of Understandable Contingency Plans
Markov decision processes (MDPs) and contingency planning (CP) are two widely used approaches to planning under uncertainty. MDPs are attractive because the model is extremely gen...
Max Horstmann, Shlomo Zilberstein