Sciweavers

48 search results - page 4 / 10
» Approximate Planning in POMDPs with Macro-Actions
Sort
View
101
Voted
ATAL
2007
Springer
15 years 5 months ago
Subjective approximate solutions for decentralized POMDPs
A problem of planning for cooperative teams under uncertainty is a crucial one in multiagent systems. Decentralized partially observable Markov decision processes (DECPOMDPs) prov...
Anton Chechetka, Katia P. Sycara
JAIR
2010
115views more  JAIR 2010»
14 years 10 months ago
An Investigation into Mathematical Programming for Finite Horizon Decentralized POMDPs
Decentralized planning in uncertain environments is a complex task generally dealt with by using a decision-theoretic approach, mainly through the framework of Decentralized Parti...
Raghav Aras, Alain Dutech
ISRR
2005
Springer
163views Robotics» more  ISRR 2005»
15 years 5 months ago
POMDP Planning for Robust Robot Control
POMDPs provide a rich framework for planning and control in partially observable domains. Recent new algorithms have greatly improved the scalability of POMDPs, to the point where...
Joelle Pineau, Geoffrey J. Gordon
95
Voted
NIPS
2007
15 years 1 months ago
What makes some POMDP problems easy to approximate?
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...
David Hsu, Wee Sun Lee, Nan Rong
98
Voted
JAIR
2006
160views more  JAIR 2006»
14 years 11 months ago
Anytime Point-Based Approximations for Large POMDPs
The Partially Observable Markov Decision Process has long been recognized as a rich framework for real-world planning and control problems, especially in robotics. However exact s...
Joelle Pineau, Geoffrey J. Gordon, Sebastian Thrun