102 search results - page 15 / 21 » MDPs with Non-Deterministic Policies |
ILP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Many reinforcement learning domains are highly relational. While traditional temporal-difference methods can be applied to these domains, they are limited in their capaci...
ICML
1994
IEEE
13 years 11 months ago
1994
IEEE
Reinforcement learning (RL) algorithms provide a sound theoretical basis for building learning control architectures for embedded agents. Unfortunately all of the theory and much ...
ATAL
2008
Springer
13 years 9 months ago
2008
Springer
Decentralized Markov decision processes are frequently used to model cooperative multi-agent systems. In this paper, we identify a subclass of general DEC-MDPs that features regul...
ATAL
2005
Springer
13 years 9 months ago
2005
Springer
A constrained agent is limited in the actions that it can take at any given time, and a challenging problem is to design policies for such agents to do the best they can despite t...
ATAL
2007
Springer
14 years 1 months ago
2007
Springer
Planning in single-agent models like MDPs and POMDPs can be carried out by resorting to Q-value functions: a (near-) optimal Q-value function is computed in a recursive manner by ...