Sciweavers

47 search results - page 3 / 10
» Average-Reward Decentralized Markov Decision Processes
Sort
View
AAAI
2006
13 years 10 months ago
An Iterative Algorithm for Solving Constrained Decentralized Markov Decision Processes
Despite the significant progress to extend Markov Decision Processes (MDP) to cooperative multi-agent systems, developing approaches that can deal with realistic problems remains ...
Aurélie Beynier, Abdel-Illah Mouaddib
ATAL
2007
Springer
14 years 2 months ago
On opportunistic techniques for solving decentralized Markov decision processes with temporal constraints
Decentralized Markov Decision Processes (DEC-MDPs) are a popular model of agent-coordination problems in domains with uncertainty and time constraints but very difficult to solve...
Janusz Marecki, Milind Tambe
ATAL
2005
Springer
14 years 2 months ago
A polynomial algorithm for decentralized Markov decision processes with temporal constraints
One of the difficulties to adapt MDPs for the control of cooperative multi-agent systems, is the complexity issued from Decentralized MDPs. Moreover, existing approaches can not ...
Aurélie Beynier, Abdel-Illah Mouaddib
ATAL
2004
Springer
14 years 1 months 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...