43 search results - page 1 / 9 » Belief Selection in Point-Based Planning Algorithms for POMD... |
182
click to vote
AI
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Current point-based planning algorithms for solving partially observable Markov decision processes (POMDPs) have demonstrated that a good approximation of the value funct...
193
Voted
JAIR
2006
15 years 6 months ago
2006
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...
164
Voted
IJCAI
2003
15 years 8 months ago
2003
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...
182
Voted
IJCAI
2007
15 years 8 months ago
2007
Planning in partially-observable dynamical systems (such as POMDPs and PSRs) is a computationally challenging task. Popular approximation techniques that have proved successful ar...
190
Voted
ECML
2006
Springer
15 years 10 months ago
2006
Springer
Recent scaling up of POMDP solvers towards realistic applications is largely due to point-based methods such as PBVI, Perseus, and HSVI, which quickly converge to an approximate so...