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 metadatas

Cited literature [9 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01928092
Contributor : Nicolas Carrara <>
Submitted on : Tuesday, November 20, 2018 - 1:44:34 PM
Last modification on : Thursday, October 17, 2019 - 8:57:09 AM

File

ewrl_14_2018_paper_67.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01928092, version 1

Citation

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⟩

Share

Metrics

Record views

74

Files downloads

55