771 search results - page 83 / 155 » Markov Decision Processes with Arbitrary Reward Processes |
126
click to vote
ATAL
2007
Springer
15 years 10 months ago
2007
Springer
In this paper, we address the problem of building a system of autonomous agents for a complex environment, in our case, a museum with many visitors. Visitors may have varying pref...
158
click to vote
PRICAI
2000
Springer
15 years 7 months ago
2000
Springer
This paper presents the CQ algorithm which decomposes and solves a Markov Decision Process (MDP) by automatically generating a hierarchy of smaller MDPs using state variables. The ...
141
click to vote
ATAL
2010
Springer
15 years 5 months ago
2010
Springer
In this paper, we study a particular subclass of partially observable models, called quasi-deterministic partially observable Markov decision processes (QDET-POMDPs), characterize...
210
click to vote
CLIMA
2011
14 years 3 months ago
2011
Multi-agent systems are an increasingly important software paradigm and in many of its applications agents cooperate to achieve a particular goal. This requires the design of effi...
155
click to vote
ICML
1996
IEEE
16 years 4 months ago
1996
IEEE
Some of the most successful recent applications of reinforcement learning have used neural networks and the TD algorithm to learn evaluation functions. In this paper, we examine t...