Sciweavers

350 search results - page 41 / 70
» Complexity of Planning with Partial Observability
Sort
View
ATAL
2008
Springer
13 years 9 months ago
Exploiting locality of interaction in factored Dec-POMDPs
Decentralized partially observable Markov decision processes (Dec-POMDPs) constitute an expressive framework for multiagent planning under uncertainty, but solving them is provabl...
Frans A. Oliehoek, Matthijs T. J. Spaan, Shimon Wh...
IJCAI
2003
13 years 9 months ago
Writer's Aid: Using a Planner in a Collaborative Interface
Writer’s Aid is a collaborative system that works simultaneously with an author editing a document providing assistance in identifying and inserting citation keys and autonomous...
Tamara Babaian, Barbara J. Grosz, Stuart M. Shiebe...
ATAL
2006
Springer
13 years 11 months ago
A decision-theoretic approach to file consistency in constrained peer-to-peer device networks
As users interact with an increasing array of personal computing devices, maintaining consistency of data across those devices becomes significantly more difficult. Typical soluti...
David L. Roberts, Sooraj Bhat, Charles Lee Isbell ...
NIPS
2007
13 years 9 months ago
Bayes-Adaptive POMDPs
Bayesian Reinforcement Learning has generated substantial interest recently, as it provides an elegant solution to the exploration-exploitation trade-off in reinforcement learning...
Stéphane Ross, Brahim Chaib-draa, Joelle Pi...
UAI
2008
13 years 9 months ago
Hierarchical POMDP Controller Optimization by Likelihood Maximization
Planning can often be simplified by decomposing the task into smaller tasks arranged hierarchically. Charlin et al. [4] recently showed that the hierarchy discovery problem can be...
Marc Toussaint, Laurent Charlin, Pascal Poupart