334 search results - page 45 / 67 » How to Dynamically Merge Markov Decision Processes |
128
click to vote
NIPS
2001
15 years 5 months ago
2001
We present a principled and efficient planning algorithm for cooperative multiagent dynamic systems. A striking feature of our method is that the coordination and communication be...
143
click to vote
ICMLA
2009
15 years 1 months ago
2009
In sequential decision making under uncertainty, as in many other modeling endeavors, researchers observe a dynamical system and collect data measuring its behavior over time. The...
146
Voted
ALDT
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
170
Voted
ATAL
2011
Springer
14 years 4 months ago
2011
Springer
Researchers in the field of multiagent sequential decision making have commonly used the terms “weakly-coupled” and “loosely-coupled” to qualitatively classify problems i...
135
Voted
AVSS
2005
IEEE
15 years 9 months ago
2005
IEEE
This paper reports on the integration of multi-camera tracking into an agent-based framework, which features autonomous task allocation for smart cameras targeting traffic survei...