Sciweavers

73 search results - page 11 / 15
» A Logic for Planning under Partial Observability
Sort
View
SIGMOD
2001
ACM
158views Database» more  SIGMOD 2001»
14 years 7 months ago
Generating Efficient Plans for Queries Using Views
We study the problem of generating e cient, equivalent rewritings using views to compute the answer to a query. We take the closed-world assumption, in which views are materialize...
Foto N. Afrati, Chen Li, Jeffrey D. Ullman
AAAI
2004
13 years 9 months ago
Distance Estimates for Planning in the Discrete Belief Space
We present a general framework for studying heuristics for planning in the belief space. Earlier work has focused on giving implementations of heuristics that work well on benchma...
Jussi Rintanen
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
1998
13 years 9 months ago
Two Forms of Dependence in Propositional Logic: Controllability and Definability
We investigate two forms of dependence between variables and/or formulas within a propositional knowledge base: controllability (a set of variables X controls a formula , if there...
Jérôme Lang, Pierre Marquis
ICRA
2008
IEEE
173views Robotics» more  ICRA 2008»
14 years 2 months ago
Bayesian reinforcement learning in continuous POMDPs with application to robot navigation
— We consider the problem of optimal control in continuous and partially observable environments when the parameters of the model are not known exactly. Partially Observable Mark...
Stéphane Ross, Brahim Chaib-draa, Joelle Pi...