2005 search results - page 205 / 401 » Decisive Markov Chains |
103
click to vote
ATAL
2007
Springer
15 years 8 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...
138
click to vote
PRICAI
2000
Springer
15 years 5 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 ...
110
Voted
ATAL
2008
Springer
15 years 3 months ago
2008
Springer
The ability for an agent to reason under uncertainty is crucial for many planning applications, since an agent rarely has access to complete, error-free information about its envi...
119
click to vote
ATAL
2010
Springer
15 years 2 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...
120
click to vote
AMAI
2006
Springer
15 years 1 months ago
2006
Springer
A weakness of classical Markov decision processes (MDPs) is that they scale very poorly due to the flat state-space representation. Factored MDPs address this representational pro...