基于MaxPain架构的奖惩并行深度强化学习

Jiexin Wang, Stefan Elfwing, E. Uchibe
{"title":"基于MaxPain架构的奖惩并行深度强化学习","authors":"Jiexin Wang, Stefan Elfwing, E. Uchibe","doi":"10.1109/DEVLRN.2018.8761044","DOIUrl":null,"url":null,"abstract":"Traditionally, reinforcement learning treats punishments as negative rewards. However, in biological decision systems, some evidence shows that animals have separate systems for rewards and punishments. The MaxPain architecture parallelizes the predictions of rewards and punishments and scales them into dual-attribute policies, and has been shown to both improve the learning speed and the learning of safer behaviors. This paper extends the MaxPain architecture into a deep reinforcement learning framework using convolutional neural networks to approximate two action-value functions. To derive the behavioral policy, we consider the mixture distributions of the policies computed from the two action-value functions. For evaluation, we compare the MaxPain architecture with count-based exploration and a reward-decomposing structure called Hybrid Reward Architecture (HRA) in grid-world navigation and vision-based navigation in a U-shape maze in the Gazebo robot simulation environment. The simulation results show the superiority of the MaxPain approach over the count-based method because the MaxPain agents efficiently avoid dead-end states by predicting future punishments. In addition, the MaxPain agents learn safe behaviors, while the HRA agents learn similar behaviors, as in the case of no punishments.","PeriodicalId":236346,"journal":{"name":"2018 Joint IEEE 8th International Conference on Development and Learning and Epigenetic Robotics (ICDL-EpiRob)","volume":"187 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Deep Reinforcement Learning by Parallelizing Reward and Punishment using the MaxPain Architecture\",\"authors\":\"Jiexin Wang, Stefan Elfwing, E. Uchibe\",\"doi\":\"10.1109/DEVLRN.2018.8761044\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Traditionally, reinforcement learning treats punishments as negative rewards. However, in biological decision systems, some evidence shows that animals have separate systems for rewards and punishments. The MaxPain architecture parallelizes the predictions of rewards and punishments and scales them into dual-attribute policies, and has been shown to both improve the learning speed and the learning of safer behaviors. This paper extends the MaxPain architecture into a deep reinforcement learning framework using convolutional neural networks to approximate two action-value functions. To derive the behavioral policy, we consider the mixture distributions of the policies computed from the two action-value functions. For evaluation, we compare the MaxPain architecture with count-based exploration and a reward-decomposing structure called Hybrid Reward Architecture (HRA) in grid-world navigation and vision-based navigation in a U-shape maze in the Gazebo robot simulation environment. The simulation results show the superiority of the MaxPain approach over the count-based method because the MaxPain agents efficiently avoid dead-end states by predicting future punishments. In addition, the MaxPain agents learn safe behaviors, while the HRA agents learn similar behaviors, as in the case of no punishments.\",\"PeriodicalId\":236346,\"journal\":{\"name\":\"2018 Joint IEEE 8th International Conference on Development and Learning and Epigenetic Robotics (ICDL-EpiRob)\",\"volume\":\"187 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 Joint IEEE 8th International Conference on Development and Learning and Epigenetic Robotics (ICDL-EpiRob)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DEVLRN.2018.8761044\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 Joint IEEE 8th International Conference on Development and Learning and Epigenetic Robotics (ICDL-EpiRob)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DEVLRN.2018.8761044","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

传统上,强化学习将惩罚视为负面奖励。然而,在生物决策系统中,一些证据表明动物有单独的奖励和惩罚系统。MaxPain架构将奖惩预测并行化,并将其扩展为双属性策略,并已被证明既可以提高学习速度,又可以学习更安全的行为。本文将MaxPain架构扩展为一个深度强化学习框架,使用卷积神经网络来近似两个动作值函数。为了导出行为策略,我们考虑了由两个动作值函数计算的策略的混合分布。为了进行评估,我们将MaxPain架构与网格世界导航中的基于计数的探索和称为混合奖励架构(HRA)的奖励分解结构进行了比较,并在Gazebo机器人仿真环境中对u形迷宫中的基于视觉的导航进行了比较。仿真结果表明MaxPain方法优于基于计数的方法,因为MaxPain代理通过预测未来的惩罚有效地避免了死胡同状态。此外,MaxPain代理学习安全行为,而HRA代理学习类似的行为,如在没有惩罚的情况下。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Deep Reinforcement Learning by Parallelizing Reward and Punishment using the MaxPain Architecture
Traditionally, reinforcement learning treats punishments as negative rewards. However, in biological decision systems, some evidence shows that animals have separate systems for rewards and punishments. The MaxPain architecture parallelizes the predictions of rewards and punishments and scales them into dual-attribute policies, and has been shown to both improve the learning speed and the learning of safer behaviors. This paper extends the MaxPain architecture into a deep reinforcement learning framework using convolutional neural networks to approximate two action-value functions. To derive the behavioral policy, we consider the mixture distributions of the policies computed from the two action-value functions. For evaluation, we compare the MaxPain architecture with count-based exploration and a reward-decomposing structure called Hybrid Reward Architecture (HRA) in grid-world navigation and vision-based navigation in a U-shape maze in the Gazebo robot simulation environment. The simulation results show the superiority of the MaxPain approach over the count-based method because the MaxPain agents efficiently avoid dead-end states by predicting future punishments. In addition, the MaxPain agents learn safe behaviors, while the HRA agents learn similar behaviors, as in the case of no punishments.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信