499 search results - page 7 / 100 » Model Minimization in Markov Decision Processes |
ATAL
2004
Springer
15 years 5 months ago
2004
Springer
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...
ICONIP
2009
14 years 9 months ago
2009
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...
108
click to vote
UAI
2000
15 years 29 days ago
2000
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...
NIPS
2004
15 years 1 months ago
2004
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...
DSN
2006
IEEE
15 years 5 months ago
2006
IEEE
This paper provides a technique, based on partially observable Markov decision processes (POMDPs), for building automatic recovery controllers to guide distributed system recovery...