49 search results - page 10 / 10 » Game theoretic Golog under partial observability |
TIT
2008
13 years 4 months ago
2008
Recently, it has been observed that a sparse trigonometric polynomial, i.e. having only a small number of non-zero coefficients, can be reconstructed exactly from a small number o...
AAAI
2004
13 years 6 months ago
2004
We present a general framework for studying heuristics for planning in the belief space. Earlier work has focused on giving implementations of heuristics that work well on benchma...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Spectral clustering is one of the most widely used techniques for extracting the underlying global structure of a data set. Compressed sensing and matrix completion have emerged a...
ICRA
2008
IEEE
13 years 11 months ago
2008
IEEE
Abstract— We propose a new approximate algorithm, LAJIV (Lookahead J-MDP Information Value), to solve Oracular Partially Observable Markov Decision Problems (OPOMDPs), a special ...