Optimizing Reinforcement Learning Agents in Games Using Curriculum Learning and Reward Shaping

IF 1.7 4区 计算机科学 Q4 COMPUTER SCIENCE, SOFTWARE ENGINEERING Computer Animation and Virtual Worlds Pub Date : 2025-02-25 DOI:10.1002/cav.70008
Adil Khan,  Muhammad, Muhammad Naeem
{"title":"Optimizing Reinforcement Learning Agents in Games Using Curriculum Learning and Reward Shaping","authors":"Adil Khan,&nbsp; Muhammad,&nbsp;Muhammad Naeem","doi":"10.1002/cav.70008","DOIUrl":null,"url":null,"abstract":"<div>\n \n <p>VizDoom is a flexible platform for researching reinforcement learning (RL) within the Doom game environment. This research article analyzes the effectiveness of the proximal policy optimization (PPO) algorithm in the VizDoom Deadly Corridor scenario. The PPO algorithm has not been adequately assessed before in a first-person shooter-based research environment, specifically VizDoom. Thus, this article applied reward shaping and curriculum learning techniques to improve the algorithm's performance in complex and challenging scenarios of the first-person shooter game Doom. The goal is to analyze and evaluate the effectiveness of the PPO algorithm successfully in the scenario of the three-dimensional VizDoom environment. The agent has a record score up to 734 on the first hard level, 1576 on the second hard level, 1920 on the third hard level, 2280 on the fourth hard level, and 1605 on the fifth hard level which is the highest difficult level of the scenario. The results are compared to provide valuable insights for researchers in optimizing reinforcement learning agents in games. The study also discusses the potential of the Doom game for research in artificial intelligence. The results of this study can be used to enhance the performance of reinforcement learning algorithms in game-based environments.</p>\n </div>","PeriodicalId":50645,"journal":{"name":"Computer Animation and Virtual Worlds","volume":"36 1","pages":""},"PeriodicalIF":1.7000,"publicationDate":"2025-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Animation and Virtual Worlds","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/cav.70008","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

Abstract

VizDoom is a flexible platform for researching reinforcement learning (RL) within the Doom game environment. This research article analyzes the effectiveness of the proximal policy optimization (PPO) algorithm in the VizDoom Deadly Corridor scenario. The PPO algorithm has not been adequately assessed before in a first-person shooter-based research environment, specifically VizDoom. Thus, this article applied reward shaping and curriculum learning techniques to improve the algorithm's performance in complex and challenging scenarios of the first-person shooter game Doom. The goal is to analyze and evaluate the effectiveness of the PPO algorithm successfully in the scenario of the three-dimensional VizDoom environment. The agent has a record score up to 734 on the first hard level, 1576 on the second hard level, 1920 on the third hard level, 2280 on the fourth hard level, and 1605 on the fifth hard level which is the highest difficult level of the scenario. The results are compared to provide valuable insights for researchers in optimizing reinforcement learning agents in games. The study also discusses the potential of the Doom game for research in artificial intelligence. The results of this study can be used to enhance the performance of reinforcement learning algorithms in game-based environments.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
利用课程学习和奖励塑造优化游戏中的强化学习代理
VizDoom是一个在Doom游戏环境中研究强化学习(RL)的灵活平台。本文分析了近端策略优化(PPO)算法在VizDoom致命走廊场景中的有效性。PPO算法之前还没有在第一人称射击游戏的研究环境中得到充分的评估,特别是在VizDoom中。因此,本文运用奖励塑造和课程学习技术来改善算法在第一人称射击游戏《毁灭战士》复杂且具有挑战性场景中的表现。目标是在三维VizDoom环境场景中成功分析和评估PPO算法的有效性。话务员在第一个困难关卡的记录分数为734分,第二个困难关卡的记录分数为1576分,第三个困难关卡的记录分数为1920分,第四个困难关卡的记录分数为2280分,第五个困难关卡的记录分数为1605分。将结果进行比较,为研究人员优化游戏中的强化学习代理提供有价值的见解。该研究还讨论了《毁灭战士》游戏在人工智能研究方面的潜力。本研究的结果可用于提高基于游戏环境的强化学习算法的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Computer Animation and Virtual Worlds
Computer Animation and Virtual Worlds 工程技术-计算机:软件工程
CiteScore
2.20
自引率
0.00%
发文量
90
审稿时长
6-12 weeks
期刊介绍: With the advent of very powerful PCs and high-end graphics cards, there has been an incredible development in Virtual Worlds, real-time computer animation and simulation, games. But at the same time, new and cheaper Virtual Reality devices have appeared allowing an interaction with these real-time Virtual Worlds and even with real worlds through Augmented Reality. Three-dimensional characters, especially Virtual Humans are now of an exceptional quality, which allows to use them in the movie industry. But this is only a beginning, as with the development of Artificial Intelligence and Agent technology, these characters will become more and more autonomous and even intelligent. They will inhabit the Virtual Worlds in a Virtual Life together with animals and plants.
期刊最新文献
Development and Preliminary Validation of an Immersive Virtual Reality Serious Game for Subway Fire Emergency Plan Training A Virtual Instructor-Led System for Assessing and Guiding Middle School Physics Experiments Predicting Learners' Attention Under Audiovisual Cues in Virtual Reality With a Deep Learning Model Development of a DT-Driven Virtual Reality for Human-Robot Collaborative Safety Education Using Formwork Design A Knowledge Visualization Method Based on Knowledge Cube for Virtual Reality Learning
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1