IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v61y2023i1p65-80.html
   My bibliography  Save this article

Anti-conflict AGV path planning in automated container terminals based on multi-agent reinforcement learning

Author

Listed:
  • Hongtao Hu
  • Xurui Yang
  • Shichang Xiao
  • Feiyang Wang

Abstract

AGV conflict prevention path planning is a key factor to improve transportation cost and operation efficiency of the container terminal. This paper studies the anti-conflict path planning problem of Automated Guided Vehicle (AGV) in the horizontal transportation area of the Automated Container Terminals (ACTs). According to the characteristics of magnetic nail guided AGVs, a node network is constructed. Through the analysis of two conflict situations, namely the opposite conflict situation and same point occupation conflict situation, an integer programming model is established to obtain the shortest path. The Multi-Agent Deep Deterministic Policy Gradient (MADDPG) method is proposed to solve the problem, and the Gumbel-Softmax strategy is applied to discretize the scenario created by the node network. A series of numerical experiments are conducted to verify the effectiveness and the efficiency of the model and the algorithm.

Suggested Citation

  • Hongtao Hu & Xurui Yang & Shichang Xiao & Feiyang Wang, 2023. "Anti-conflict AGV path planning in automated container terminals based on multi-agent reinforcement learning," International Journal of Production Research, Taylor & Francis Journals, vol. 61(1), pages 65-80, January.
    • Handle: RePEc:taf:tprsxx:v:61:y:2023:i:1:p:65-80
    DOI: 10.1080/00207543.2021.1998695
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2021.1998695
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2021.1998695?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.

    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:taf:tprsxx:v:61:y:2023:i:1:p:65-80. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.