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

A Novel Behavioral Strategy for RoboCode Platform Based on Deep Q-Learning

Author

Listed:
  • Hakan Kayakoku
  • Mehmet Serdar Guzel
  • Erkan Bostanci
  • Ihsan Tolga Medeni
  • Deepti Mishra
  • Kalyana C. Veluvolu

Abstract

This paper addresses a new machine learning-based behavioral strategy using the deep Q-learning algorithm for the RoboCode simulation platform. According to this strategy, a new model is proposed for the RoboCode platform, providing an environment for simulated robots that can be programmed to battle against other robots. Compared to Atari Games, RoboCode has a fairly wide set of actions and situations. Due to the challenges of training a CNN model for such a continuous action space problem, the inputs obtained from the simulation environment were generated dynamically, and the proposed model was trained by using these inputs. The trained model battled against the predefined rival robots of the environment (standard robots) by cumulatively benefiting from the experience of these robots. The comparison between the proposed model and standard robots of RoboCode Platform was statistically verified. Finally, the performance of the proposed model was compared with machine learning based-customized robots (community robots). Experimental results reveal that the proposed model is mostly superior to community robots. Therefore, the deep Q-learning-based model has proven to be successful in such a complex simulation environment. It should also be noted that this new model facilitates simulation performance in adaptive and partially cluttered environments.

Suggested Citation

  • Hakan Kayakoku & Mehmet Serdar Guzel & Erkan Bostanci & Ihsan Tolga Medeni & Deepti Mishra & Kalyana C. Veluvolu, 2021. "A Novel Behavioral Strategy for RoboCode Platform Based on Deep Q-Learning," Complexity, Hindawi, vol. 2021, pages 1-14, July.
  • Handle: RePEc:hin:complx:9963018
    DOI: 10.1155/2021/9963018
    as

    Download full text from publisher

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

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

    File URL: https://libkey.io/10.1155/2021/9963018?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:9963018. 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.