Sciweavers

656 search results - page 4 / 132
» Complexity of finite-horizon Markov decision process problem...
Sort
View
AAAI
1997
14 years 11 months ago
Incremental Methods for Computing Bounds in Partially Observable Markov Decision Processes
Partially observable Markov decision processes (POMDPs) allow one to model complex dynamic decision or control problems that include both action outcome uncertainty and imperfect ...
Milos Hauskrecht
86
Voted
ARTMED
2000
105views more  ARTMED 2000»
14 years 9 months ago
Planning treatment of ischemic heart disease with partially observable Markov decision processes
Diagnosis of a disease and its treatment are not separate, one-shot activities. Instead, they are very often dependent and interleaved over time. This is mostly due to uncertainty...
Milos Hauskrecht, Hamish S. F. Fraser
ICALP
2005
Springer
15 years 3 months ago
Recursive Markov Decision Processes and Recursive Stochastic Games
We introduce Recursive Markov Decision Processes (RMDPs) and Recursive Simple Stochastic Games (RSSGs), which are classes of (finitely presented) countable-state MDPs and zero-su...
Kousha Etessami, Mihalis Yannakakis
AI
2008
Springer
14 years 9 months ago
Reachability analysis of uncertain systems using bounded-parameter Markov decision processes
Verification of reachability properties for probabilistic systems is usually based on variants of Markov processes. Current methods assume an exact model of the dynamic behavior a...
Di Wu, Xenofon D. Koutsoukos
75
Voted
UAI
2004
14 years 11 months ago
Dynamic Programming for Structured Continuous Markov Decision Problems
We describe an approach for exploiting structure in Markov Decision Processes with continuous state variables. At each step of the dynamic programming, the state space is dynamica...
Zhengzhu Feng, Richard Dearden, Nicolas Meuleau, R...