656 search results - page 13 / 132 » Complexity of finite-horizon Markov decision process problem... |
116
click to vote
NIPS
2004
15 years 3 months ago
2004
Existing algorithms for discrete partially observable Markov decision processes can at best solve problems of a few thousand states due to two important sources of intractability:...
127
Voted
AAAI
2011
14 years 1 months ago
2011
In environmental and natural resource planning domains actions are taken at a large number of locations over multiple time periods. These problems have enormous state and action s...
115
click to vote
MDAI
2005
Springer
15 years 7 months ago
2005
Springer
We formulate a fuzzy perceptive model for Markov decision processes with discounted payoff in which the perception for transition probabilities is described by fuzzy sets. Our aim...
91
Voted
AAAI
2006
15 years 3 months ago
2006
In multiple criteria Markov Decision Processes (MDP) where multiple costs are incurred at every decision point, current methods solve them by minimising the expected primary cost ...
109
Voted
ICRA
2007
IEEE
15 years 8 months ago
2007
IEEE
— We introduce the Oracular Partially Observable Markov Decision Process (OPOMDP), a type of POMDP in which the world produces no observations; instead there is an “oracle,” ...