Sciweavers

62 search results - page 6 / 13
» Probabilistic inference for solving discrete and continuous ...
Sort
View
ML
2002
ACM
146views Machine Learning» more  ML 2002»
13 years 7 months ago
Variable Resolution Discretization in Optimal Control
Abstract. The problemof state abstractionis of centralimportancein optimalcontrol,reinforcement learning and Markov decision processes. This paper studies the case of variable reso...
Rémi Munos, Andrew W. Moore
NIPS
2004
13 years 8 months ago
VDCBPI: an Approximate Scalable Algorithm for Large POMDPs
Existing algorithms for discrete partially observable Markov decision processes can at best solve problems of a few thousand states due to two important sources of intractability:...
Pascal Poupart, Craig Boutilier
QEST
2010
IEEE
13 years 5 months ago
Symblicit Calculation of Long-Run Averages for Concurrent Probabilistic Systems
Abstract--Model checkers for concurrent probabilistic systems have become very popular within the last decade. The study of long-run average behavior has however received only scan...
Ralf Wimmer, Bettina Braitling, Bernd Becker, Erns...
IJFCS
2008
130views more  IJFCS 2008»
13 years 7 months ago
Equivalence of Labeled Markov Chains
We consider the equivalence problem for labeled Markov chains (LMCs), where each state is labeled with an observation. Two LMCs are equivalent if every finite sequence of observat...
Laurent Doyen, Thomas A. Henzinger, Jean-Fran&cced...
ATAL
2009
Springer
14 years 2 months ago
Planning with continuous resources for agent teams
Many problems of multiagent planning under uncertainty require distributed reasoning with continuous resources and resource limits. Decentralized Markov Decision Problems (Dec-MDP...
Janusz Marecki, Milind Tambe