Skip to Main content Skip to Navigation
Conference papers

A Fitted-Q Algorithm for Budgeted MDPs

Abstract : We address the problem of budgeted reinforcement learning, in continuous state-space, using a batch of transitions. To this extend, we introduce a novel algorithm called Budgeted Fitted-Q (BFTQ). Benchmarks show that BFTQ performs as well as a regular Fitted-Q algorithm in a continuous 2-D world but also allows one to choose the right amount of budget that fits to a given task without the need of engineering the rewards. We believe that the general principles used to design BFTQ can be applied to extend others classical reinforcement learning algorithms for budgeted oriented applications.
Document type :
Conference papers
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download
Contributor : Nicolas Carrara Connect in order to contact the contributor
Submitted on : Tuesday, November 20, 2018 - 1:44:34 PM
Last modification on : Wednesday, September 1, 2021 - 4:41:31 PM


Files produced by the author(s)


  • HAL Id : hal-01928092, version 1


Nicolas Carrara, Romain Laroche, Jean-Léon Bouraoui, Tanguy Urvoy, Olivier Pietquin. A Fitted-Q Algorithm for Budgeted MDPs. EWRL 2018 - 14th European workshop on Reinforcement Learning, Oct 2018, Lille, France. ⟨hal-01928092⟩



Record views


Files downloads