Sciweavers

102 search results - page 2 / 21
» VDCBPI: an Approximate Scalable Algorithm for Large POMDPs
Sort
View
ATAL
2009
Springer
13 years 11 months ago
Constraint-based dynamic programming for decentralized POMDPs with structured interactions
Decentralized partially observable MDPs (DEC-POMDPs) provide a rich framework for modeling decision making by a team of agents. Despite rapid progress in this area, the limited sc...
Akshat Kumar, Shlomo Zilberstein
NIPS
2003
13 years 6 months ago
Approximate Planning in POMDPs with Macro-Actions
Recent research has demonstrated that useful POMDP solutions do not require consideration of the entire belief space. We extend this idea with the notion of temporal abstraction. ...
Georgios Theocharous, Leslie Pack Kaelbling
NIPS
2007
13 years 6 months ago
Theoretical Analysis of Heuristic Search Methods for Online POMDPs
Planning in partially observable environments remains a challenging problem, despite significant recent advances in offline approximation techniques. A few online methods have a...
Stéphane Ross, Joelle Pineau, Brahim Chaib-...
ICRA
2010
IEEE
163views Robotics» more  ICRA 2010»
13 years 3 months ago
Exploiting domain knowledge in planning for uncertain robot systems modeled as POMDPs
Abstract— We propose a planning algorithm that allows usersupplied domain knowledge to be exploited in the synthesis of information feedback policies for systems modeled as parti...
Salvatore Candido, James C. Davidson, Seth Hutchin...
IJCAI
2003
13 years 6 months ago
Point-based value iteration: An anytime algorithm for POMDPs
This paper introduces the Point-Based Value Iteration (PBVI) algorithm for POMDP planning. PBVI approximates an exact value iteration solution by selecting a small set of represen...
Joelle Pineau, Geoffrey J. Gordon, Sebastian Thrun