Sciweavers

29 search results - page 1 / 6
» Dynamic Programming Approximations for Partially Observable ...
Sort
View
FLAIRS
2009
13 years 2 months ago
Dynamic Programming Approximations for Partially Observable Stochastic Games
Partially observable stochastic games (POSGs) provide a rich mathematical framework for planning under uncertainty by a group of agents. However, this modeling advantage comes wit...
Akshat Kumar, Shlomo Zilberstein
AAAI
2004
13 years 6 months ago
Dynamic Programming for Partially Observable Stochastic Games
We develop an exact dynamic programming algorithm for partially observable stochastic games (POSGs). The algorithm is a synthesis of dynamic programming for partially observable M...
Eric A. Hansen, Daniel S. Bernstein, Shlomo Zilber...
AAAI
2006
13 years 6 months ago
Point-based Dynamic Programming for DEC-POMDPs
We introduce point-based dynamic programming (DP) for decentralized partially observable Markov decision processes (DEC-POMDPs), a new discrete DP algorithm for planning strategie...
Daniel Szer, François Charpillet
ATAL
2004
Springer
13 years 10 months ago
Approximate Solutions for Partially Observable Stochastic Games with Common Payoffs
Partially observable decentralized decision making in robot teams is fundamentally different from decision making in fully observable problems. Team members cannot simply apply si...
Rosemary Emery-Montemerlo, Geoffrey J. Gordon, Jef...
ATAL
2005
Springer
13 years 10 months ago
Game theoretic Golog under partial observability
We present the agent programming language POGTGolog, which combines explicit agent programming in Golog with game-theoretic multi-agent planning in a special kind of partially obs...
Alberto Finzi, Thomas Lukasiewicz