120 search results - page 3 / 24 » Hierarchical Solution of Markov Decision Processes using Mac... |
ICML
2010
IEEE
14 years 11 months ago
2010
IEEE
Approximate dynamic programming has been used successfully in a large variety of domains, but it relies on a small set of provided approximation features to calculate solutions re...
PRICAI
2000
Springer
15 years 1 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 ...
ATAL
2004
Springer
15 years 3 months ago
2004
Springer
In multi-agent MDPs, it is generally necessary to consider the joint state space of all agents, making the size of the problem and the solution exponential in the number of agents...
UAI
2003
14 years 11 months ago
2003
This paper examines a number of solution methods for decision processes with non-Markovian rewards (NMRDPs). They all exploit a temporal logic specification of the reward functio...
IJCAI
2007
14 years 11 months ago
2007
Agents often have to construct plans that obey deadlines or, more generally, resource limits for real-valued resources whose consumption can only be characterized by probability d...