23 search results - page 1 / 5 » On Finding Compromise Solutions in Multiobjective Markov Dec... |
ECAI
2010
Springer
13 years 5 months ago
2010
Springer
A Markov Decision Process (MDP) is a general model for solving planning problems under uncertainty. It has been extended to multiobjective MDP to address multicriteria or multiagen...
UAI
2000
13 years 6 months 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...
ICML
2006
IEEE
14 years 5 months ago
2006
IEEE
Recent decision-theoric planning algorithms are able to find optimal solutions in large problems, using Factored Markov Decision Processes (fmdps). However, these algorithms need ...
ICTAI
2000
IEEE
13 years 8 months ago
2000
IEEE
Markov Decision Processes (MDP) have been widely used as a framework for planning under uncertainty. They allow to compute optimal sequences of actions in order to achieve a given...
FLAIRS
2008
13 years 7 months ago
2008
We address the problem of computing an optimal value function for Markov decision processes. Since finding this function quickly and accurately requires substantial computation ef...