Sciweavers

52 search results - page 3 / 11
» Error Bounds for Approximate Policy Iteration
Sort
View
ICPR
2000
IEEE
15 years 2 months ago
Modeling Range Images with Bounded Error Triangular Meshes without Optimization
This paper presents a new technique for approximating range images by means of adaptive triangular meshes with a bounded approximation error and without applying optimization. Thi...
Angel Domingo Sappa, Miguel Angel García
ICML
2005
IEEE
15 years 10 months ago
Finite time bounds for sampling based fitted value iteration
In this paper we consider sampling based fitted value iteration for discounted, large (possibly infinite) state space, finite action Markovian Decision Problems where only a gener...
Csaba Szepesvári, Rémi Munos
NIPS
2004
14 years 11 months ago
VDCBPI: an Approximate Scalable Algorithm for Large POMDPs
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:...
Pascal Poupart, Craig Boutilier
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
14 years 7 months ago
Efficient Planning in Large POMDPs through Policy Graph Based Factorized Approximations
Partially observable Markov decision processes (POMDPs) are widely used for planning under uncertainty. In many applications, the huge size of the POMDP state space makes straightf...
Joni Pajarinen, Jaakko Peltonen, Ari Hottinen, Mik...
CAD
2007
Springer
14 years 9 months ago
Error analysis of reparametrization based approaches for curve offsetting
This paper proposes an error analysis of reparametrization based approaches for planar curve offsetting. The approximation error in Hausdorff distance is computed. The error is bo...
Hong-Yan Zhao, Guo-Jin Wang