IDEAS home Printed from https://ideas.repec.org/a/spr/jsched/v27y2024i3d10.1007_s10951-023-00792-8.html
   My bibliography  Save this article

Improving scheduling in multi-AGV systems by task prediction

Author

Listed:
  • Hongkai Fan

    (Hunan University)

  • Dong Li

    (Hunan University)

  • Bo Ouyang

    (Hunan University)

  • Zhi Yan

    (Hunan University)

  • Yaonan Wang

    (Hunan University)

Abstract

Automated guided vehicles (AGVs) are driverless robotic vehicles that pick up and deliver materials. Finding ways to improve efficiency while preventing deadlocks is a core issue in designing AGV systems. In this paper, we propose an approach to improve the efficiency of traditional deadlock-free scheduling algorithms. Typically, AGVs have to travel to designated starting locations from their parking locations to execute tasks, the time required for which is referred to as preparation time. The proposed approach aims at reducing the preparation time by predicting the starting locations for future tasks and then making decisions on whether to send an AGV to the predicted starting location of the upcoming task, thus reducing the time spent waiting for an AGV to arrive at the starting location after the upcoming task is created. Cases in which wrong predictions have been made are also addressed in the proposed method. Simulation results show that the proposed method significantly improves efficiency, up to 20–30% as compared with traditional methods.

Suggested Citation

  • Hongkai Fan & Dong Li & Bo Ouyang & Zhi Yan & Yaonan Wang, 2024. "Improving scheduling in multi-AGV systems by task prediction," Journal of Scheduling, Springer, vol. 27(3), pages 299-308, June.
    • Handle: RePEc:spr:jsched:v:27:y:2024:i:3:d:10.1007_s10951-023-00792-8
    DOI: 10.1007/s10951-023-00792-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10951-023-00792-8
    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/s10951-023-00792-8?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.

    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:jsched:v:27:y:2024:i:3:d:10.1007_s10951-023-00792-8. 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: 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.