238 search results - page 12 / 48 » Value-Function Approximations for Partially Observable Marko... |
109
Voted
AAAI
1994
15 years 4 months ago
1994
In this paper, we describe the partially observable Markov decision process pomdp approach to nding optimal or near-optimal control strategies for partially observable stochastic ...
161
Voted
ICML
2006
IEEE
2006
IEEE
Automatic basis function construction for approximate dynamic programming and reinforcement learning
15 years 9 months ago
We address the problem of automatically constructing basis functions for linear approximation of the value function of a Markov Decision Process (MDP). Our work builds on results ...
123
click to vote
JMLR
2006
15 years 3 months ago
2006
We propose a novel approach to optimize Partially Observable Markov Decisions Processes (POMDPs) defined on continuous spaces. To date, most algorithms for model-based POMDPs are ...
125
Voted
ATAL
2007
Springer
15 years 7 months ago
2007
Springer
In multiagent planning, it is often convenient to view a problem as two subproblems: agent local planning and coordination. Thus, we can classify agent activities into two categor...
125
Voted
ICTAI
1996
IEEE
15 years 7 months ago
1996
IEEE
This paper presents an approach to building plans using partially observable Markov decision processes. The approach begins with a base solution that assumes full observability. T...