47 search results - page 6 / 10 » Average-Reward Decentralized Markov Decision Processes |
ATAL
2007
Springer
14 years 17 days ago
2007
Springer
In multiagent planning, it is often convenient to view a problem as two subproblems: agent local planning and coordination. Thus, we can classify agent activities into two categor...
ICTAI
2007
IEEE
14 years 2 months ago
2007
IEEE
Unlike mono-agent systems, multi-agent planing addresses the problem of resolving conflicts between individual and group interests. In this paper, we are using a Decentralized Ve...
IJCAI
2003
13 years 10 months ago
2003
The problem of deriving joint policies for a group of agents that maximize some joint reward function can be modeled as a decentralized partially observable Markov decision proces...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
This paper investigates the decentralized detection of Hidden Markov Processes using the NeymanPearson test. We consider a network formed by a large number of distributed sensors....
ATAL
2006
Springer
14 years 9 days ago
2006
Springer
Decentralized partially observable Markov decision processes (DEC-POMDPs) form a general framework for planning for groups of cooperating agents that inhabit a stochastic and part...