Sciweavers

771 search results - page 56 / 155
» Markov Decision Processes with Arbitrary Reward Processes
Sort
View
CORR
2010
Springer
112views Education» more  CORR 2010»
15 years 4 months ago
Efficient Approximation of Optimal Control for Markov Games
The success of probabilistic model checking for discrete-time Markov decision processes and continuous-time Markov chains has led to rich academic and industrial applications. The ...
Markus Rabe, Sven Schewe, Lijun Zhang
ICTAI
1996
IEEE
15 years 8 months ago
Incremental Markov-Model Planning
This paper presents an approach to building plans using partially observable Markov decision processes. The approach begins with a base solution that assumes full observability. T...
Richard Washington
142
Voted
ICML
1994
IEEE
15 years 7 months ago
Markov Games as a Framework for Multi-Agent Reinforcement Learning
In the Markov decision process (MDP) formalization of reinforcement learning, a single adaptive agent interacts with an environment defined by a probabilistic transition function....
Michael L. Littman
JAIR
2006
122views more  JAIR 2006»
15 years 4 months ago
Solving Factored MDPs with Hybrid State and Action Variables
Efficient representations and solutions for large decision problems with continuous and discrete variables are among the most important challenges faced by the designers of automa...
Branislav Kveton, Milos Hauskrecht, Carlos Guestri...
FSTTCS
2006
Springer
15 years 7 months ago
Testing Probabilistic Equivalence Through Reinforcement Learning
We propose a new approach to verification of probabilistic processes for which the model may not be available. We use a technique from Reinforcement Learning to approximate how far...
Josee Desharnais, François Laviolette, Sami...