Optimistic planning for belief-augmented Markov decision processes - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

Optimistic planning for belief-augmented Markov decision processes

(1) , (2) , (3)
Lucian Busoniu
  • Function : Author
  • PersonId : 933138
Rémi Munos
  • Function : Author
  • PersonId : 836863


This paper presents the Bayesian Optimistic Planning (BOP) algorithm, a novel model-based Bayesian reinforcement learning approach. BOP extends the planning approach of the Optimistic Planning for Markov Decision Processes (OP-MDP) algorithm [10], [9] to contexts where the transition model of the MDP is initially unknown and progressively learned through interactions within the environment. The knowledge about the unknown MDP is represented with a probability distribution over all possible transition models using Dirichlet distributions, and the BOP algorithm plans in the belief-augmented state space constructed by concatenating the original state vector with the current posterior distribution over transition models. We show that BOP becomes Bayesian optimal when the budget parameter increases to infinity. Preliminary empirical validations show promising performance.
Fichier principal
Vignette du fichier
adprl.pdf (464.82 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00840202 , version 1 (01-07-2013)


  • HAL Id : hal-00840202 , version 1


Raphael Fonteneau, Lucian Busoniu, Rémi Munos. Optimistic planning for belief-augmented Markov decision processes. IEEE International Symposium on Adaptive Dynamic Programming and reinforcement Learning, ADPRL 2013, Apr 2013, Singapour, Singapore. pp.CDROM. ⟨hal-00840202⟩
305 View
244 Download


Gmail Facebook Twitter LinkedIn More