656 search results - page 25 / 132 » Complexity of finite-horizon Markov decision process problem... |
142
click to vote
JAIR
2008
15 years 1 months ago
2008
Probabilistic planning problems are typically modeled as a Markov Decision Process (MDP). MDPs, while an otherwise expressive model, allow only for sequential, non-durative action...
117
click to vote
AAAI
2008
15 years 4 months ago
2008
Decentralized Markov Decision Processes are a powerful general model of decentralized, cooperative multi-agent problem solving. The high complexity of the general problem leads to...
125
Voted
UAI
2003
15 years 3 months ago
2003
For a given problem, the optimal Markov policy over a finite horizon is a conditional plan containing a potentially large number of branches. However, there are applications wher...
105
Voted
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...
111
Voted
UAI
2003
15 years 3 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...