Sciweavers

238 search results - page 15 / 48
» Value-Function Approximations for Partially Observable Marko...
Sort
View
NIPS
2001
15 years 7 months ago
Multiagent Planning with Factored MDPs
We present a principled and efficient planning algorithm for cooperative multiagent dynamic systems. A striking feature of our method is that the coordination and communication be...
Carlos Guestrin, Daphne Koller, Ronald Parr
JAIR
2006
160views more  JAIR 2006»
15 years 5 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
WIOPT
2011
IEEE
14 years 9 months ago
Network utility maximization over partially observable Markovian channels
Abstract—This paper considers maximizing throughput utility in a multi-user network with partially observable Markov ON/OFF channels. Instantaneous channel states are never known...
Chih-Ping Li, Michael J. Neely
JAIR
2010
108views more  JAIR 2010»
15 years 4 months ago
Kalman Temporal Differences
This paper deals with value (and Q-) function approximation in deterministic Markovian decision processes (MDPs). A general statistical framework based on the Kalman filtering pa...
Matthieu Geist, Olivier Pietquin
CDC
2008
IEEE
140views Control Systems» more  CDC 2008»
16 years 5 days ago
Information state for Markov decision processes with network delays
We consider a networked control system, where each subsystem evolves as a Markov decision process (MDP). Each subsystem is coupled to its neighbors via communication links over wh...
Sachin Adlakha, Sanjay Lall, Andrea J. Goldsmith