1138 search results - page 72 / 228 » Feature Markov Decision Processes |
100
Voted
NIPS
2001
15 years 2 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...
118
click to vote
CJ
2004
15 years 15 days ago
2004
This paper describes a way to manage the modeling and analysis of Scheduled Maintenance Systems (SMS) within an analytically tractable context. We chose a significant case study h...
ICML
2008
IEEE
16 years 1 months ago
2008
IEEE
Partially Observable Markov Decision Processes (POMDPs) have succeeded in planning domains that require balancing actions that increase an agent's knowledge and actions that ...
87
Voted
ICALP
2009
Springer
16 years 28 days ago
2009
Springer
We define stochastic timed games, which extend two-player timed games with probabilities (following a recent approach by Baier et al), and which extend in a natural way continuous-...
74
Voted
ECML
2007
Springer
15 years 6 months ago
2007
Springer
In this article, we present an idea for solving deterministic partially observable markov decision processes (POMDPs) based on a history space containing sequences of past observat...