Sciweavers

87 search results - page 9 / 18
» A policy iteration algorithm for Markov decision processes s...
Sort
View
IJCAI
2001
13 years 9 months ago
Symbolic Dynamic Programming for First-Order MDPs
We present a dynamic programming approach for the solution of first-order Markov decisions processes. This technique uses an MDP whose dynamics is represented in a variant of the ...
Craig Boutilier, Raymond Reiter, Bob Price
TSMC
2011
258views more  TSMC 2011»
13 years 2 months ago
Cross-Entropy Optimization of Control Policies With Adaptive Basis Functions
—This paper introduces an algorithm for direct search of control policies in continuous-state discrete-action Markov decision processes. The algorithm looks for the best closed-l...
Lucian Busoniu, Damien Ernst, Bart De Schutter, Ro...
ICML
2003
IEEE
14 years 8 months ago
Planning in the Presence of Cost Functions Controlled by an Adversary
We investigate methods for planning in a Markov Decision Process where the cost function is chosen by an adversary after we fix our policy. As a running example, we consider a rob...
H. Brendan McMahan, Geoffrey J. Gordon, Avrim Blum
ATAL
2006
Springer
13 years 11 months ago
On the relationship between MDPs and the BDI architecture
In this paper we describe the initial results of an investigation into the relationship between Markov Decision Processes (MDPs) and Belief-Desire-Intention (BDI) architectures. W...
Gerardo I. Simari, Simon Parsons
AAAI
2010
13 years 9 months ago
Using Bisimulation for Policy Transfer in MDPs
Knowledge transfer has been suggested as a useful approach for solving large Markov Decision Processes. The main idea is to compute a decision-making policy in one environment and...
Pablo Samuel Castro, Doina Precup