Proxy functions for Approximate Reinforcement Learning

Eduard Alibekov, Jiří Kubalík, Robert Babuška

Research output: Contribution to journalConference articleScientificpeer-review

58 Downloads (Pure)

Abstract

Approximate Reinforcement Learning (RL) is a method to solve sequential decisionmaking and dynamic control problems in an optimal way. This paper addresses RL for continuous state spaces which derive the control policy by using an approximate value function (V-function). The standard approach to derive a policy through the V-function is analogous to hill climbing: at each state the RL agent chooses the control input that maximizes the right-hand side of the Bellman equation. Although theoretically optimal, the actual control performance of this method is heavily influenced by the local smoothness of the V-function; a lack of smoothness results in undesired closed-loop behavior with input chattering or limit-cycles. To circumvent these problems, this paper provides a method based on Symbolic Regression to generate a locally smooth proxy to the V-function. The proposed method has been evaluated on two nonlinear control benchmarks: pendulum swing-up and magnetic manipulation. The new method has been compared with the standard policy derivation technique using the approximate V-function and the results show that the proposed approach outperforms the standard one with respect to the cumulative return.

Original languageEnglish
Pages (from-to)224-229
JournalIFAC-PapersOnLine
Volume52
Issue number11
DOIs
Publication statusPublished - 2019
Event5th IFAC Conference on Intelligent Control and Automation Sciences, ICONS 2019 - Belfast, United Kingdom
Duration: 21 Aug 201923 Aug 2019

Keywords

  • continuous state space
  • optimal control
  • policy derivation
  • reinforcement learning
  • V-function

Fingerprint

Dive into the research topics of 'Proxy functions for Approximate Reinforcement Learning'. Together they form a unique fingerprint.

Cite this