Sciweavers

10 search results - page 1 / 2
» Improving Anytime Point-Based Value Iteration Using Principl...
Sort
View
IJCAI
2007
13 years 6 months ago
Improving Anytime Point-Based Value Iteration Using Principled Point Selections
Planning in partially-observable dynamical systems (such as POMDPs and PSRs) is a computationally challenging task. Popular approximation techniques that have proved successful ar...
Michael R. James, Michael E. Samples, Dmitri A. Do...
JAIR
2006
160views more  JAIR 2006»
13 years 4 months ago
Anytime Point-Based Approximations for Large POMDPs
The Partially Observable Markov Decision Process has long been recognized as a rich framework for real-world planning and control problems, especially in robotics. However exact s...
Joelle Pineau, Geoffrey J. Gordon, Sebastian Thrun
IJCAI
2003
13 years 6 months ago
Point-based value iteration: An anytime algorithm for POMDPs
This paper introduces the Point-Based Value Iteration (PBVI) algorithm for POMDP planning. PBVI approximates an exact value iteration solution by selecting a small set of represen...
Joelle Pineau, Geoffrey J. Gordon, Sebastian Thrun
CVPR
2009
IEEE
14 years 11 months ago
Harris Corners in the Real World: A Principled Selection Criterion for Interest Points Based on Ecological Statistics
In this report, we consider whether statistical regularities in natural images might be exploited to provide an improved selection criterion for interest points. One approach that ...
Neil D. B. Bruce, Pierre Kornprobst
AI
2006
Springer
13 years 8 months ago
Belief Selection in Point-Based Planning Algorithms for POMDPs
Abstract. Current point-based planning algorithms for solving partially observable Markov decision processes (POMDPs) have demonstrated that a good approximation of the value funct...
Masoumeh T. Izadi, Doina Precup, Danielle Azar