Sciweavers

54 search results - page 2 / 11
» Planning with POMDPs Using a Compact, Logic-Based Representa...
Sort
View
AAAI
2006
13 years 9 months ago
Compact, Convex Upper Bound Iteration for Approximate POMDP Planning
Partially observable Markov decision processes (POMDPs) are an intuitive and general way to model sequential decision making problems under uncertainty. Unfortunately, even approx...
Tao Wang, Pascal Poupart, Michael H. Bowling, Dale...
AAAI
2010
13 years 9 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
IJCAI
2007
13 years 9 months ago
Relational Knowledge with Predictive State Representations
Most work on Predictive Representations of State (PSRs) has focused on learning and planning in unstructured domains (for example, those represented by flat POMDPs). This paper e...
David Wingate, Vishal Soni, Britton Wolfe, Satinde...
NIPS
2003
13 years 8 months ago
A Nonlinear Predictive State Representation
Predictive state representations (PSRs) use predictions of a set of tests to represent the state of controlled dynamical systems. One reason why this representation is exciting as...
Matthew R. Rudary, Satinder P. Singh
AAAI
2006
13 years 9 months ago
Controlled Search over Compact State Representations, in Nondeterministic Planning Domains and Beyond
Two of the most efficient planners for planning in nondeterministic domains are MBP and ND-SHOP2. MBP achieves its efficiency by using Binary Decision Diagrams (BDDs) to represent...
Ugur Kuter, Dana S. Nau