A Cooperative Distributed Problem Solving Technique for Large Markov Decision Processes

Authors:
Abdel-Illah Mouaddib;Simon Le Gloannec
Affiliations:
GREYC-CNRS/Université de Caen, {mouaddib,slegloan}@info.unicaen.fr;GREYC-CNRS/Université de Caen, {mouaddib,slegloan}@info.unicaen.fr
Venue:
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Year:
2006

Citing 3
Cited 0

A polynomial algorithm for decentralized Markov decision processes with temporal constraints

Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
An iterative algorithm for solving constrained decentralized Markov decision processes

AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
Flexible decomposition algorithms for weakly coupled Markov decision problems

UAI'98 Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider the problem of solving a large MDP in a distributed way among several processors. To do that, we propose an approach which decomposes the large MDP into smaller ones each of which is solved on a unique processor. The obtained joint local policies derived from the small MDPs (subMDPs) behave in the same way of the policy of the initial MDP.