Sciweavers

829 search results - page 18 / 166
» A time aggregation approach to Markov decision processes
Sort
View
UAI
2004
15 years 3 months ago
Dynamic Programming for Structured Continuous Markov Decision Problems
We describe an approach for exploiting structure in Markov Decision Processes with continuous state variables. At each step of the dynamic programming, the state space is dynamica...
Zhengzhu Feng, Richard Dearden, Nicolas Meuleau, R...
QEST
2006
IEEE
15 years 8 months ago
LiQuor: A tool for Qualitative and Quantitative Linear Time analysis of Reactive Systems
LiQuor is a tool for verifying probabilistic reactive systems modelled Probmela programs, which are terms of a probabilistic guarded command language with an operational semantics...
Frank Ciesinski, Christel Baier
129
Voted
ENTCS
2006
134views more  ENTCS 2006»
15 years 1 months ago
Partial Order Reduction for Probabilistic Branching Time
In the past, partial order reduction has been used successfully to combat the state explosion problem in the context of model checking for non-probabilistic systems. For both line...
Christel Baier, Pedro R. D'Argenio, Marcus Grö...
IROS
2009
IEEE
206views Robotics» more  IROS 2009»
15 years 8 months ago
Bayesian reinforcement learning in continuous POMDPs with gaussian processes
— Partially Observable Markov Decision Processes (POMDPs) provide a rich mathematical model to handle realworld sequential decision processes but require a known model to be solv...
Patrick Dallaire, Camille Besse, Stéphane R...
142
Voted
IJCAI
2001
15 years 3 months ago
An Improved Grid-Based Approximation Algorithm for POMDPs
Although a partially observable Markov decision process (POMDP) provides an appealing model for problems of planning under uncertainty, exact algorithms for POMDPs are intractable...
Rong Zhou, Eric A. Hansen