Sciweavers

181 search results - page 2 / 37
» Online Planning Algorithms for POMDPs
Sort
View
NIPS
2003
13 years 10 months 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
ICMLA
2004
13 years 10 months ago
Planning with predictive state representations
Predictive state representation (PSR) models for controlled dynamical systems have recently been proposed as an alternative to traditional models such as partially observable Mark...
Michael R. James, Satinder P. Singh, Michael L. Li...
ATAL
2010
Springer
13 years 9 months ago
Risk-sensitive planning in partially observable environments
Partially Observable Markov Decision Process (POMDP) is a popular framework for planning under uncertainty in partially observable domains. Yet, the POMDP model is riskneutral in ...
Janusz Marecki, Pradeep Varakantham
IJCAI
2001
13 years 10 months ago
An Improved Grid-Based Approximation Algorithm for POMDPs
Although a partially observable Markov decision process (POMDP) provides an appealing model for problems of planning under uncertainty, exact algorithms for POMDPs are intractable...
Rong Zhou, Eric A. Hansen
AIPS
2009
13 years 9 months ago
Exploiting Coordination Locales in Distributed POMDPs via Social Model Shaping
Distributed POMDPs provide an expressive framework for modeling multiagent collaboration problems, but NEXPComplete complexity hinders their scalability and application in real-wo...
Pradeep Varakantham, Jun-young Kwak, Matthew E. Ta...