1138 search results - page 170 / 228 » Feature Markov Decision Processes |
127
click to vote
NIPS
2007
15 years 5 months ago
2007
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...
128
Voted
AAAI
2006
15 years 4 months ago
2006
We present a new algorithm, called incremental least squares policy iteration (ILSPI), for finding the infinite-horizon stationary policy for partially observable Markov decision ...
137
Voted
FLAIRS
2004
15 years 4 months ago
2004
er provides new techniques for abstracting the state space of a Markov Decision Process (MDP). These techniques extend one of the recent minimization models, known as -reduction, ...
124
Voted
NIPS
2001
15 years 4 months ago
2001
Policy gradient methods for reinforcement learning avoid some of the undesirable properties of the value function approaches, such as policy degradation (Baxter and Bartlett, 2001...
129
Voted
IJCAI
2003
15 years 4 months ago
2003
An agent with limited consumable execution resources needs policies that attempt to achieve good performance while respecting these limitations. Otherwise, an agent (such as a pla...