IDEAS home Printed from https://ideas.repec.org/a/spr/infosf/v26y2024i1d10.1007_s10796-021-10218-5.html
   My bibliography  Save this article

Deep Reinforcement Learning-Based Robot Exploration for Constructing Map of Unknown Environment

Author

Listed:
  • Shih-Yeh Chen

    (National Taitung University)

  • Qi-Fong He

    (Taiwan Semiconductor Manufacturing Company ltd.)

  • Chin-Feng Lai

    (National Cheng Kung University)

Abstract

In traditional environment exploration algorithms, two problems are still waiting to be solved. One is that as the exploration time increases, the robot will repeatedly explore the areas that have been explored. The other is that in order to explore the environment more accurately, the robot will cause slight collisions during the exploration process. In order to solve the two problems, a DQN-based exploration model is proposed, which enables the robot to quickly find the unexplored area in an unknown environment, and designs a DQN-based navigation model to solve the local minima problem generated by the robot during the exploration. Through the switching mechanism of exploration model and navigation model, the robot can quickly complete the exploration task through selecting the modes according to the environment exploration situation. In the experiment results, the difference between the proposed unknown environment exploration method and the previous known-environment exploration methods research is less than 5% under the same exploration time. And in the proposed method, the robot can achieve zero collision and almost zero repeated exploration of the area when it has been trained for 30w rounds. Therefore, it can be seen that the proposed method is more practical than the previous methods.

Suggested Citation

  • Shih-Yeh Chen & Qi-Fong He & Chin-Feng Lai, 2024. "Deep Reinforcement Learning-Based Robot Exploration for Constructing Map of Unknown Environment," Information Systems Frontiers, Springer, vol. 26(1), pages 63-74, February.
  • Handle: RePEc:spr:infosf:v:26:y:2024:i:1:d:10.1007_s10796-021-10218-5
    DOI: 10.1007/s10796-021-10218-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10796-021-10218-5
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10796-021-10218-5?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Francesco Leofante & Erika Ábrahám & Tim Niemueller & Gerhard Lakemeyer & Armando Tacchella, 2019. "Integrated Synthesis and Execution of Optimal Plans for Multi-Robot Systems in Logistics," Information Systems Frontiers, Springer, vol. 21(1), pages 87-107, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Lionel P. Robert & Marcelo Fantinato & Sangseok You & Patrick C. K. Hung, 2024. "Social Robotics Business and Computing," Information Systems Frontiers, Springer, vol. 26(1), pages 1-8, February.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Thouraya Bouabana-Tebibel & Stuart H. Rubin & Lydia Bouzar-Benlabiod, 2019. "Guest Editorial: Recent Trends in Reuse and Integration," Information Systems Frontiers, Springer, vol. 21(1), pages 1-3, February.
    2. Tobias Albrecht & Marie-Sophie Baier & Henner Gimpel & Simon Meierhöfer & Maximilian Röglinger & Jörg Schlüchtermann & Lisanne Will, 2024. "Leveraging Digital Technologies in Logistics 4.0: Insights on Affordances from Intralogistics Processes," Information Systems Frontiers, Springer, vol. 26(2), pages 755-774, April.

    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:spr:infosf:v:26:y:2024:i:1:d:10.1007_s10796-021-10218-5. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.