Sciweavers

43 search results - page 6 / 9
» Belief Selection in Point-Based Planning Algorithms for POMD...
Sort
View
ISRR
2005
Springer
163views Robotics» more  ISRR 2005»
15 years 3 months ago
POMDP Planning for Robust Robot Control
POMDPs provide a rich framework for planning and control in partially observable domains. Recent new algorithms have greatly improved the scalability of POMDPs, to the point where...
Joelle Pineau, Geoffrey J. Gordon
IROS
2006
IEEE
121views Robotics» more  IROS 2006»
15 years 3 months ago
Planning and Acting in Uncertain Environments using Probabilistic Inference
— An important problem in robotics is planning and selecting actions for goal-directed behavior in noisy uncertain environments. The problem is typically addressed within the fra...
Deepak Verma, Rajesh P. N. Rao
HCI
2009
14 years 7 months ago
Partially Observable Markov Decision Process (POMDP) Technologies for Sign Language Based Human-Computer Interaction
Sign language (SL) recognition modules in human-computer interaction systems need to be both fast and reliable. In cases where multiple sets of features are extracted from the SL d...
Sylvie C. W. Ong, David Hsu, Wee Sun Lee, Hanna Ku...
AAAI
2010
14 years 11 months ago
PUMA: Planning Under Uncertainty with Macro-Actions
Planning in large, partially observable domains is challenging, especially when a long-horizon lookahead is necessary to obtain a good policy. Traditional POMDP planners that plan...
Ruijie He, Emma Brunskill, Nicholas Roy
AAAI
2010
14 years 11 months ago
Relational Partially Observable MDPs
Relational Markov Decision Processes (MDP) are a useraction for stochastic planning problems since one can develop abstract solutions for them that are independent of domain size ...
Chenggang Wang, Roni Khardon