Sciweavers

JAIR
2006
160views more  JAIR 2006»
13 years 11 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
NIPS
2003
14 years 8 days ago
Applying Metric-Trees to Belief-Point POMDPs
Recent developments in grid-based and point-based approximation algorithms for POMDPs have greatly improved the tractability of POMDP planning. These approaches operate on sets of...
Joelle Pineau, Geoffrey J. Gordon, Sebastian Thrun
ECML
2006
Springer
14 years 2 months ago
Prioritizing Point-Based POMDP Solvers
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...
Guy Shani, Ronen I. Brafman, Solomon Eyal Shimony
ICRA
2005
IEEE
118views Robotics» more  ICRA 2005»
14 years 4 months ago
Planning with Continuous Actions in Partially Observable Environments
Abstract— We present a simple randomized POMDP algorithm for planning with continuous actions in partially observable environments. Our algorithm operates on a set of reachable b...
Matthijs T. J. Spaan, Nikos A. Vlassis