IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0352782.html

Multi-AGV task scheduling and dynamic map path planning based on task pre-allocation

Author

Listed:
  • Jie Gao
  • Weinan Xie
  • Haoya Liu
  • Junda Zhou
  • Liang Wang
  • Jieke Liang

Abstract

Multi-AGV (Automated Guided Vehicle) systems operating in complex warehouse environments equipped with movable containers encounter several challenges, including high system no-load rate, low task response efficiency, and imbalanced path utilization. To address these issues, we propose an integrated optimization approach for task scheduling and path planning. First, a task segmentation strategy is introduced to decompose complex tasks into long-distance transport and precision in-racking sub-tasks which are then allocated to heterogeneous AGV types for execution. Second, a task pre-allocation algorithm is designed to enable AGVs to participate in the subsequent task assignment prior to the completion of their current tasks, thereby reducing the system no-load rate. Third, a dynamic map path planning mechanism is developed, which incorporates a temporary path traffic control module and a localized Floyd update algorithm to achieve real-time path adjustment and effective path utilization optimization. Comparative experiments were conducted in a multi-zone warehouse simulation environment. The results demonstrate that the proposed approach can reduce the system no-load rate, mitigate path congestion, and enhance overall operational performance.

Suggested Citation

  • Jie Gao & Weinan Xie & Haoya Liu & Junda Zhou & Liang Wang & Jieke Liang, 2026. "Multi-AGV task scheduling and dynamic map path planning based on task pre-allocation," PLOS ONE, Public Library of Science, vol. 21(7), pages 1-28, July.
  • Handle: RePEc:plo:pone00:0352782
    DOI: 10.1371/journal.pone.0352782
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0352782
    Download Restriction: no

    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0352782&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pone.0352782?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:plo:pone00:0352782. 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.