• DocumentCode
    2711043
  • Title

    Reinforcement learning of multiple tasks using parametric bias

  • Author

    Rybicki, Leszek ; Sugita, Yuuya ; Tani, Jun

  • Author_Institution
    Dept. of Math. & Comput. Sci., Nicolaus Copernicus Univ., Torun, Poland
  • fYear
    2009
  • fDate
    14-19 June 2009
  • Firstpage
    2732
  • Lastpage
    2739
  • Abstract
    We propose a reinforcement learning system designed to learn multiple different continuous state-action-space tasks. The system has been tested on a family of space-searching task akin to Morris water maze, but with obstacles. While exploring a task, the agent builds its internal model of the environment and approximates a state value function. For learning multiple tasks, we use a parametric bias switching mechanism in which the value of the parametric bias layer identifies the task for the agent. Each task has a specific parametric bias vector, and during training the vectors self-organize to reflect the structure of relationships between tasks in the task set. This mapping of the task set to parametric bias space can later be used to generate novel behaviors of the agent.
  • Keywords
    collision avoidance; control system synthesis; function approximation; intelligent robots; learning (artificial intelligence); learning systems; mobile robots; self-adjusting systems; state-space methods; time-varying systems; Morris water maze; mobile agent multiple-continuous state-action-space task training; obstacle avoidance; parametric bias vector switching mechanism; reinforcement learning system design; self-organizing system; space-searching task; state value function approximation; Delay; Function approximation; Laboratories; Learning; Mathematical model; Mathematics; Neural networks; Predictive models; State-space methods; System testing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Neural Networks, 2009. IJCNN 2009. International Joint Conference on
  • Conference_Location
    Atlanta, GA
  • ISSN
    1098-7576
  • Print_ISBN
    978-1-4244-3548-7
  • Electronic_ISBN
    1098-7576
  • Type

    conf

  • DOI
    10.1109/IJCNN.2009.5178868
  • Filename
    5178868