Sciweavers

107 search results - page 15 / 22
» Approximate Linear Programming for Constrained Partially Obs...
Sort
View
NIPS
2004
13 years 8 months ago
A Cost-Shaping LP for Bellman Error Minimization with Performance Guarantees
We introduce a new algorithm based on linear programming that approximates the differential value function of an average-cost Markov decision process via a linear combination of p...
Daniela Pucci de Farias, Benjamin Van Roy
ATAL
2009
Springer
14 years 2 months ago
Lossless clustering of histories in decentralized POMDPs
Decentralized partially observable Markov decision processes (Dec-POMDPs) constitute a generic and expressive framework for multiagent planning under uncertainty. However, plannin...
Frans A. Oliehoek, Shimon Whiteson, Matthijs T. J....
AAAI
2007
13 years 9 months ago
Scaling Up: Solving POMDPs through Value Based Clustering
Partially Observable Markov Decision Processes (POMDPs) provide an appropriately rich model for agents operating under partial knowledge of the environment. Since finding an opti...
Yan Virin, Guy Shani, Solomon Eyal Shimony, Ronen ...
ICCD
2006
IEEE
171views Hardware» more  ICCD 2006»
14 years 4 months ago
Stochastic Dynamic Thermal Management: A Markovian Decision-based Approach
This paper proposes a stochastic dynamic thermal management (DTM) technique in high-performance VLSI system with especial attention to the uncertainty in temperature observation. ...
Hwisung Jung, Massoud Pedram
SOCO
2010
Springer
13 years 2 months ago
Using evolution strategies to solve DEC-POMDP problems
Decentralized partially observable Markov decision process (DEC-POMDP) is an approach to model multi-robot decision making problems under uncertainty. Since it is NEXP-complete the...
Baris Eker, H. Levent Akin