IDEAS home Printed from https://ideas.repec.org/a/hin/complx/6698231.html
   My bibliography  Save this article

AIBPO: Combine the Intrinsic Reward and Auxiliary Task for 3D Strategy Game

Author

Listed:
  • Huale Li
  • Rui Cao
  • Xuan Wang
  • Xiaohan Hou
  • Tao Qian
  • Fengwei Jia
  • Jiajia Zhang
  • Shuhan Qi
  • Abd E.I.-Baset Hassanien

Abstract

In recent years, deep reinforcement learning (DRL) achieves great success in many fields, especially in the field of games, such as AlphaGo, AlphaZero, and AlphaStar. However, due to the reward sparsity problem, the traditional DRL-based method shows limited performance in 3D games, which contain much higher dimension of state space. To solve this problem, in this paper, we propose an intrinsic-based policy optimization (IBPO) algorithm for reward sparsity. In the IBPO, a novel intrinsic reward is integrated into the value network, which provides an additional reward in the environment with sparse reward, so as to accelerate the training. Besides, to deal with the problem of value estimation bias, we further design three types of auxiliary tasks, which can evaluate the state value and the action more accurately in 3D scenes. Finally, a framework of auxiliary intrinsic-based policy optimization (AIBPO) is proposed, which improves the performance of the IBPO. The experimental results show that the method is able to deal with the reward sparsity problem effectively. Therefore, the proposed method may be applied to real-world scenarios, such as 3-dimensional navigation and automatic driving, which can improve the sample utilization to reduce the cost of interactive sample collected by the real equipment.

Suggested Citation

  • Huale Li & Rui Cao & Xuan Wang & Xiaohan Hou & Tao Qian & Fengwei Jia & Jiajia Zhang & Shuhan Qi & Abd E.I.-Baset Hassanien, 2021. "AIBPO: Combine the Intrinsic Reward and Auxiliary Task for 3D Strategy Game," Complexity, Hindawi, vol. 2021, pages 1-9, July.
  • Handle: RePEc:hin:complx:6698231
    DOI: 10.1155/2021/6698231
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/complexity/2021/6698231.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/complexity/2021/6698231.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2021/6698231?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:complx:6698231. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.