Sciweavers

499 search results - page 7 / 100
» Model Minimization in Markov Decision Processes
Sort
View
ATAL
2004
Springer
14 years 26 days ago
Decentralized Markov Decision Processes with Event-Driven Interactions
Decentralized MDPs provide a powerful formal framework for planning in multi-agent systems, but the complexity of the model limits its usefulness. We study in this paper a class o...
Raphen Becker, Shlomo Zilberstein, Victor R. Lesse...
ICONIP
2009
13 years 5 months ago
Quasi-Deterministic Partially Observable Markov Decision Processes
We study a subclass of POMDPs, called quasi-deterministic POMDPs (QDET-POMDPs), characterized by deterministic actions and stochastic observations. While this framework does not mo...
Camille Besse, Brahim Chaib-draa
UAI
2000
13 years 8 months ago
The Complexity of Decentralized Control of Markov Decision Processes
We consider decentralized control of Markov decision processes and give complexity bounds on the worst-case running time for algorithms that find optimal solutions. Generalization...
Daniel S. Bernstein, Shlomo Zilberstein, Neil Imme...
NIPS
2004
13 years 8 months ago
Coarticulation in Markov Decision Processes
We investigate an approach for simultaneously committing to multiple activities, each modeled as a temporally extended action in a semi-Markov decision process (SMDP). For each ac...
Khashayar Rohanimanesh, Robert Platt Jr., Sridhar ...
DSN
2006
IEEE
14 years 1 months ago
Automatic Recovery Using Bounded Partially Observable Markov Decision Processes
This paper provides a technique, based on partially observable Markov decision processes (POMDPs), for building automatic recovery controllers to guide distributed system recovery...
Kaustubh R. Joshi, William H. Sanders, Matti A. Hi...